A general saddle point result for constrained optimization
From MaRDI portal
Publication:4401746
DOI10.1007/BF01580123zbMath0276.90055MaRDI QIDQ4401746
F. J. Gould, S. M. Howe, Kenneth J. Arrow
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (21)
Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ 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 ⋮ On Lagrange multipliers and constraints II. Augmented Lagrangian approach ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ A unified approach to complementarity in optimization ⋮ Superlinearly convergent variable metric algorithms for general nonlinear programming problems ⋮ Multiplier methods: A survey ⋮ Multiplier functions and duality for non-linear programmes having a set constraint ⋮ Unnamed Item ⋮ A second-order method for the general nonlinear programming problem ⋮ New dual-type decomposition algorithm for non-convex separable optimization problems ⋮ The multiplier method of Hestenes and Powell applied to convex programming ⋮ Comments on the general duality survey by J. Tind and L.A. Wolsey ⋮ Saddle points and Pareto points in multiple objective programming ⋮ Funciones penalidad y lagrangianos aumentados ⋮ Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions ⋮ Convergent stepsizes for constrained optimization algorithms ⋮ A dual approach to solving nonlinear programming problems by unconstrained optimization ⋮ Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
Cites Work
This page was built for publication: A general saddle point result for constrained optimization
