Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs

DOI10.1016/0167-6377(85)90030-6zbMath0565.90069OpenAlexW2055364214MaRDI QIDQ1058992

Olvi L. Mangasarian

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90030-6

zbMATH Keywords

Lagrange multipliersboundsstationary pointnonconvex differentiable nonlinear program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Separation of sets, Lagrange multipliers, and totally regular extremum problems ⋮ Augmented Lagrangian optimization under fixed-point arithmetic ⋮ Karush-Kuhn-Tucker transformation approach to multi-level linear programming problems. ⋮ Uniqueness of KKT multipliers in multiobjective optimization. ⋮ Quadratic Support Functions in Quadratic Bilevel Problems ⋮ KKT transformation approach for multi-objective multi-level linear programming problems ⋮ Error bounds for generalized Lagrange multipliers in locally Lipschitz programming

Cites Work

• Unnamed Item
• Unnamed Item
• A stable theorem of the alternative: An extension of the Gordan theorem
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Simple computable bounds for solutions of linear complementarity problems and linear programs
• A Variable-Complexity Norm Maximization Problem
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming