Saddle point and exact penalty representation for generalized proximal Lagrangians
From MaRDI portal
Publication:1928261
Recommendations
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
- Properties of saddle points for generalized augmented Lagrangian
- Saddle points of general augmented Lagrangians for constrained nonconvex optimization
- Saddle point criteria and the exact minimax penalty function method in nonconvex programming
- Existence of local saddle points for a new augmented Lagrangian function
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- A nonlinear Lagrangian approach to constrained optimization problems
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- 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.
- Further study on augmented Lagrangian duality theory
- Lagrange Multipliers and Optimality
- Lagrange-type functions in constrained non-convex optimization.
- Modified barrier functions (theory and methods)
- Multiplier and gradient methods
- Nonlinear Lagrange duality theorems and penalty function methods in continuous optimization
- On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
- On augmented Lagrangians for optimization problems with a single constraint
- On the convergence of the exponential multiplier method for convex programming
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- Saddle point generation in nonlinear nonconvex optimization
- Saddle points and Pareto points in multiple objective programming
- Some results about duality and exact penalization
- The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
- Variational Analysis
- Zero duality gap for a class of nonconvex optimization problems
Cited in
(4)- Saddle point criteria and the exact minimax penalty function method in nonconvex programming
- Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property
- Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
- Global saddle points of nonlinear augmented Lagrangian functions
This page was built for publication: Saddle point and exact penalty representation for generalized proximal Lagrangians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928261)
