A general saddle point result for constrained optimization
From MaRDI portal
Cites work
Cited in
(21)- Convergent stepsizes for constrained optimization algorithms
- A constrained min-max algorithm for rival models
- A superlinearly convergent constrained min-max algorithm for rival models of the same system
- A constrained min-max algorithm for rival models of the same economic system
- A unified approach to complementarity in optimization
- Multiplier methods: A survey
- A second-order method for the general nonlinear programming problem
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
- Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions
- New dual-type decomposition algorithm for non-convex separable optimization problems
- Zero duality gap in surrogate constraint optimization: a concise review of models
- The multiplier method of Hestenes and Powell applied to convex programming
- Saddle points and Pareto points in multiple objective programming
- Decomposition methods based on augmented Lagrangians: a survey
- scientific article; zbMATH DE number 3948007 (Why is no real title available?)
- On Lagrange multipliers and constraints II. Augmented Lagrangian approach
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Multiplier functions and duality for non-linear programmes having a set constraint
- Comments on the general duality survey by J. Tind and L.A. Wolsey
- Funciones penalidad y lagrangianos aumentados
- A dual approach to solving nonlinear programming problems by unconstrained optimization
This page was built for publication: A general saddle point result for constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401746)
