A class of globally convergent optimization methods based on conservative convex separable approximations

SIAM Journal on Optimization

Volumn 12, Issue 2, 2002, Pages 555-573

  Svanberg, Krister ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Constrained minimization; Convex approximations; Method of moving asymptotes; Nonlinear programming

Indexed keywords

EID: 0036013025     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623499362822     Document Type: Article

References (8)

1. Primal-dual interior methods for nonconvex nonlinear programming
2. A primal-dual interior method for nonconvex nonlinearly constrained optimization
3. Constrained nonlinear programming
4. The method of moving asymptotes - A new method for structural optimization
5. A globally convergent version of MMA without linesearch