| 학회 | 한국화학공학회 |
| 학술대회 | 2003년 봄 (04/25 ~ 04/26, 순천대학교) |
| 권호 | 9권 1호, p.187 |
| 발표분야 | 공정시스템 |
| 제목 | A New Global Optimization Algorithm Using D.C. Underestimator and Convex Cut Function for General NLP Problems |
| 초록 | This work presents a novel global optimization algorithm which is applicable to general NLP’s consist of twice differentiable objective and constraint functions. The algorithm iteratively generates continuous piecewise concave underestimator, difference of convex (d.c.) underestimator, of objective function and it generates convex cut functions of constraints when acquired lower bound is located at infeasible region. |
| 저자 | 박영철, 장민호, 이태용 |
| 소속 | 한국과학기술원 생명화학공학과 |
| 키워드 | global optimization algorithm; deterministic method; difference of convex (d.c.) underestimator; nonlinear constraints; convex cut function |
| , , | |
| VOD | VOD 보기 |
