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

DOI10.1016/0167-6377(85)90030-6zbMath0565.90069MaRDI 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 multipliers; bounds; stationary point; nonconvex differentiable nonlinear program

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

49M37: Numerical methods based on nonlinear programming

Related Items

Error bounds for generalized Lagrange multipliers in locally Lipschitz programming, Separation of sets, Lagrange multipliers, and totally regular extremum problems, Uniqueness of KKT multipliers in multiobjective optimization., KKT transformation approach for multi-objective multi-level linear programming problems, Karush-Kuhn-Tucker transformation approach to multi-level linear programming problems.

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