Global convergence of a nonlinear programming method using convex approximations

DOI10.1023/A:1011841821203zbMath1079.90585MaRDI QIDQ5948218

Christian Zillober

Publication date: 31 October 2001

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

global convergenceconvex approximationsmethod of moving asymptotessequential convex programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items

Variations and extension of the convex-concave procedure ⋮ Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach ⋮ Solving stress constrained problems in topology and material optimization ⋮ An algorithm for the topology optimization of geometrically nonlinear structures ⋮ Numerical instabilities and convergence control for convex approximation methods ⋮ A new method of moving asymptotes for large-scale linearly equality-constrained minimization ⋮ A topology Nash game for tumoral antiangiogenesis ⋮ A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem ⋮ Very large scale optimization by sequential convex programming ⋮ A new method of moving asymptotes for large-scale unconstrained optimization

Uses Software

• CONLIN

This page was built for publication: Global convergence of a nonlinear programming method using convex approximations