On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
From MaRDI portal
(Redirected from Publication:812415)
Recommendations
- Augmented lagrangians in semi-infinite programming
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
- A projected lagrangian algorithm for semi-infinite programming
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
- An augmented Lagrangian algorithm for solving semiinfinite programming
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 16989 (Why is no real title available?)
- scientific article; zbMATH DE number 1353937 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- 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
- Bi-level strategies in semi-infinite programming.
- Calmness and Exact Penalization
- Dual Techniques for Minimax
- First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation.
- First-order optimality conditions in generalized semi-infinite programming
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Generalized semi-infinite programming: Theory and methods
- Generalized semi-infinite programming: numerical aspects
- Local Duality of Nonlinear Programs
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- On optimality conditions for generalized semi-infinite programming problems
- On the numerical treatment of a class of semi-infinite terminal problems∗∗Partially supported by the german research society (DFG)$ef:
- On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
- Optimization and nonsmooth analysis
- Optimization. Algorithms and consistent approximations
- Variational Analysis
Cited in
(17)- An efficient algorithm for \(\min\)-\(\max\) convex semi-infinite programming problems
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- Generalized Levitin-Polyak well-posedness for generalized semi-infinite programs
- Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property
- Variational theory for optimization under stochastic ambiguity
- 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
- Continuous min-max programs with semi-infinite constraints
- Preface
- Augmented lagrangians in semi-infinite programming
- Existence of local saddle points for a new augmented Lagrangian function
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Improving ultimate convergence of an augmented Lagrangian method
- Computing power system parameters to maximize the small signal stability margin based on min-max models
- Model predictive control: recent developments and future promise
This page was built for publication: On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812415)
