Local convexification of the Lagrangian function in nonconvex optimization

DOI10.1023/A:1004628822745zbMath0960.90070OpenAlexW43200824WikidataQ57445552 ScholiaQ57445552MaRDI QIDQ1973484

Yanyan Li

Publication date: 10 May 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1004628822745

zbMATH Keywords

nonconvex optimizationLagrangian functionlocal dualitylocal convexificationp-power formulation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (12)

Unified theory of augmented Lagrangian methods for constrained global optimization ⋮ On saddle points in nonconvex semi-infinite programming ⋮ On convexification for a class of global optimization problems ⋮ Local saddle point and a class of convexification methods for nonconvex optimization problems ⋮ An alternating iterative method and its application in statistical inference ⋮ Unnamed Item ⋮ Separation approach for augmented lagrangians in Constrained nonconvex optimization ⋮ Convexification and concavification for a general class of global optimization problems ⋮ Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization ⋮ Properties of saddle points for generalized augmented Lagrangian ⋮ Unnamed Item ⋮ A note on the existence of saddle points ofp-th power Lagrangian for constrained nonconvex optimization

Cites Work

• Unnamed Item
• Local saddle points and convexification for nonconvex optimization problems
• Zero duality gap for a class of nonconvex optimization problems
• A duality theorem for non-linear programming
• Saddle point generation in nonlinear nonconvex optimization

This page was built for publication: Local convexification of the Lagrangian function in nonconvex optimization