Separation approach for augmented lagrangians in Constrained nonconvex optimization
From MaRDI portal
The authors consider a finite-dimensional inequality-constrained optimization problem. Main results of the image space analysis are recalled (see \textit{F. Gianessi} [Constraint optimization and image space analysis, Springer Verlag, Berlin (2005)]). By means of this theory, local and global saddle point conditions for a general class of augmented Lagrangian functions under suitable conditions are proved. The existence of the global saddle-point does not require the compactness of the feasible set.
Recommendations
- Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming
- Some results on augmented Lagrangians in constrained global optimization via image space analysis
- On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
- Saddle points of general augmented Lagrangians for constrained nonconvex optimization
- On saddle points of a class of augmented Lagrangian functions
Cites work
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- Convergence properties of augmented Lagrangian methods for constrained global optimization
- Convex Analysis
- Convexification and existence of a saddle point in a \(p\)th-power reformulation for nonconvex constrained optimization.
- Existence of a saddle point in nonconvex constrained optimization.
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- Lagrange-type functions in constrained non-convex optimization.
- Local convexification of the Lagrangian function in nonconvex optimization
- Multiplier and gradient methods
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
- On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
- On the twice differentiable cubic augmented Lagrangian
- Second-order and related extremality conditions in nonlinear programming
- Technical note: Directional derivatives in nonsmooth optimization
- Theorems of the alternative and optimality conditions
- Zero duality gap for a class of nonconvex optimization problems
Cited in
(36)- Constrained extremum problems and image space analysis. I: Optimality conditions
- Image space analysis to Lagrange-type duality for constrained vector optimization problems with applications
- Constrained extremum problems, regularity conditions and image space analysis. I: The scalar finite-dimensional case
- Constrained extremum problems, regularity conditions and image space analysis. II: The vector finite-dimensional case
- Characterizations for optimality conditions of general robust optimization problems
- Saddle points and gap functions for weak generalized Ky Fan inequalities
- Nonlinear separation in the image space with applications to constrained optimization
- Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
- Separation functions and optimality conditions in vector optimization
- A unified characterization of multiobjective robustness via separation
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- On saddle points in semidefinite optimization via separation scheme
- On the existence of saddle points for nonlinear second-order cone programming problems
- Conjugate duality for constrained optimization via image space analysis and abstract convexity
- Some results on augmented Lagrangians in constrained global optimization via image space analysis
- Nonlinear separation functions and constrained extremum problems
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- Image space analysis for set optimization problems with applications
- On maximum and variational principles via image space analysis
- Nonlinear separation in the image space with applications to penalty methods
- A note on the existence of saddle points of p-th power Lagrangian for constrained nonconvex optimization
- Separation of Nonconvex Sets with General Augmenting Functions
- scientific article; zbMATH DE number 3861885 (Why is no real title available?)
- Unified duality theory for constrained extremum problems. I: Image space analysis
- Unified duality theory for constrained extremum problems. II: Special duality schemes
- scientific article; zbMATH DE number 1488008 (Why is no real title available?)
- Generalized robust duality in constrained nonconvex optimization
- Optimality conditions for efficient solutions of nonconvex constrained multiobjective optimization problems via image space analysis
- Optimality conditions for vector optimization problems with non-cone constraints in image space
- On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
- Zero duality and saddle points of a class of augmented Lagrangian functions in constrained non-convex optimization
- An approach to duality via image space analysis and applications to linear vector 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
- Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming
- Unified theory of augmented Lagrangian methods for constrained global optimization
This page was built for publication: Separation approach for augmented lagrangians in Constrained nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963656)
