On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
From MaRDI portal
Publication:812415
DOI10.1007/s10589-005-2179-8zbMath1122.90082OpenAlexW2019465420MaRDI QIDQ812415
Johannes O. Royset, Elijah Polak
Publication date: 23 January 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/59m38059
semi-infinite optimizationnonsmooth optimization algorithmsaugmented Lagrangian functionsgeneralized minimax
Optimality conditions and duality in mathematical programming (90C46) 2-person games (91A05) Semi-infinite programming (90C34)
Related Items (max. 100)
Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming ⋮ Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions ⋮ A smoothing Levenberg-Marquardt method for generalized semi-infinite programming ⋮ Computing power system parameters to maximize the small signal stability margin based on min-max models ⋮ An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems ⋮ A lifting method for generalized semi-infinite programs based on lower level Wolfe duality ⋮ Unnamed Item ⋮ Existence of local saddle points for a new augmented Lagrangian function ⋮ Improving ultimate convergence of an augmented Lagrangian method ⋮ Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property ⋮ Preface ⋮ An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems ⋮ Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs ⋮ Model predictive control: recent developments and future promise ⋮ Variational Theory for Optimization under Stochastic Ambiguity
Uses Software
Cites Work
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- Generalized semi-infinite optimization: A first order optimality condition and examples
- First-order optimality conditions in generalized semi-infinite programming
- Optimization. Algorithms and consistent approximations
- Bi-level strategies in semi-infinite programming.
- On optimality conditions for generalized semi-infinite programming problems
- Generalized semi-infinite programming: Theory and methods
- Generalized semi-infinite programming: numerical aspects
- First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
- Local Duality of Nonlinear Programs
- Calmness and Exact Penalization
- On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
- Optimization and nonsmooth analysis
- Dual Techniques for Minimax
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- On the numerical treatment of a class of semi-infinite terminal problems∗∗Partially supported by the german research society (DFG)$ef:
- Variational Analysis
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
