Local saddle points and convexification for nonconvex optimization problems

DOI10.1023/A:1022613419816MaRDI QIDQ1369054zbMATH OpenOpenAlexFDO

Authors Bernhard Rupp

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

zbMATH Keywords

convexificationinequality constraintsnonconvex optimizationsaddle-point resultsecond-order sufficient conditions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Local saddle point and a class of convexification methods for nonconvex optimization problems
• On saddle points in nonconvex semi-infinite programming
• A note on the existence of saddle points of p-th power Lagrangian for constrained nonconvex optimization
• Local convexification of the Lagrangian function in nonconvex optimization

Cites work

• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• Multiplier and gradient methods
• Zero duality gap for a class of nonconvex optimization problems

Cited in

(21)

• The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
• A nonlinear Lagrangian dual for integer programming
• On saddle points in nonconvex semi-infinite programming
• Local convexification of the Lagrangian function in nonconvex optimization
• Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization
• Local saddle point and a class of convexification methods for nonconvex optimization problems
• Strong duality in optimization: shifted power reformulation
• Finding Gateaux-Saddles by a Local Minimax Method
• A note on the existence of saddle points of p-th power Lagrangian for constrained nonconvex optimization
• On saddle points and optima for non-smooth and non-convex programs
• Saddle point generation in nonlinear nonconvex optimization
• A tutorial note on a convexification procedure in non-convex semi-infinite optimization
• Local convexification of the Lagrangian function for nonlinear nonconvex optimization
• Local search in problems with nonconvex constraints
• Existence of a saddle point in nonconvex constrained optimization.
• On the Absence of Spurious Local Trajectories in Time-Varying Nonconvex Optimization
• Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
• A p-power neurodynamic approach to distributed nonconvex optimization
• 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
• Unified theory of augmented Lagrangian methods for constrained global optimization

This page was built for publication: Local saddle points and convexification for nonconvex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369054)