Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming

DOI10.1007/s00245-008-9060-yzbMath1169.49014MaRDI QIDQ836067

Xiuhua Xu, Jin Chuan Zhou, Chang-Yu Wang

Publication date: 31 August 2009

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00245-008-9060-y

zbMATH Keywords

saddle point; semi-infinite programming; first-order optimality conditions; augmented Lagrangian function

Mathematics Subject Classification ID

90C22: Semidefinite programming

49K10: Optimality conditions for free problems in two or more independent variables

Related Items

Existence of local saddle points for a new augmented Lagrangian function, A smoothing Levenberg-Marquardt method for generalized semi-infinite programming, Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
• On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
• A recursive quadratic programming algorithm for semi-infinite optimization problems
• Modified barrier functions (theory and methods)
• Optimization. Algorithms and consistent approximations
• Semismooth Newton methods for solving semi-infinite programming problems
• Lagrange-type functions in constrained non-convex optimization.
• Nonlinear Lagrange duality theorems and penalty function methods in continuous optimization
• On augmented Lagrangians for optimization problems with a single constraint
• Further study on augmented Lagrangian duality theory
• 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.
• Zero duality gap for a class of nonconvex optimization problems
• First-order optimality conditions for convex semi-infinite min-max programming with noncompact sets
• Primal-dual nonlinear rescaling method with dynamic scaling parameter update
• Multiplier and gradient methods
• Saddle points and Pareto points in multiple objective programming
• A Nonlinear Lagrangian Approach to Constrained Optimization Problems
• First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
• Lagrange Multipliers and Optimality
• Semi-Infinite Programming: Theory, Methods, and Applications
• A projected lagrangian algorithm for semi-infinite programming
• Saddle point generation in nonlinear nonconvex optimization
• Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
• Solving generalized semi-infinite programs by reduction to simpler problems
• On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
• The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
• A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
• Semi-infinite programming. Recent advances
• Existence of a saddle point in nonconvex constrained optimization.