Local saddle points and convexification for nonconvex optimization problems
From MaRDI portal
Publication:1369054
DOI10.1023/A:1022613419816zbMath0899.90136OpenAlexW205965983MaRDI QIDQ1369054
Publication date: 7 October 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022613419816
nonconvex optimizationconvexificationinequality constraintssecond-order sufficient conditionssaddle-point result
Related Items (13)
Unified theory of augmented Lagrangian methods for constrained global optimization ⋮ On saddle points in nonconvex semi-infinite programming ⋮ Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method ⋮ Local convexification of the Lagrangian function in nonconvex optimization ⋮ Local saddle point and a class of convexification methods for nonconvex optimization problems ⋮ Saddle points of general augmented Lagrangians for constrained nonconvex optimization ⋮ Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property ⋮ Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization ⋮ The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization ⋮ Strong duality in optimization: shifted power reformulation ⋮ Unnamed Item ⋮ A note on the existence of saddle points ofp-th power Lagrangian for constrained nonconvex optimization ⋮ A nonlinear Lagrangian dual for integer programming
Cites Work
This page was built for publication: Local saddle points and convexification for nonconvex optimization problems
