A strengthened test for optimality

DOI10.1007/BF00934929zbMath0473.90066OpenAlexW2072584575MaRDI QIDQ1159136

Henry Wolkowicz

Publication date: 1981

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00934929

zbMATH Keywords

Lagrange multipliersequality constraintsgradientssolution stabilityoptimality testcharacterization of optimalitycones of directions of constancydifferentiable convex functionsfaithfully convex functionsstrongest optimality conditions

Mathematics Subject Classification ID

Convex programming (90C25) Numerical methods involving duality (49M29)

Related Items (4)

Regularizing the abstract convex program ⋮ Method of reduction in convex programming ⋮ Optimality conditions for nondifferentiable convex semi-infinite programming ⋮ Generalizations of Slater's constraint qualification for infinite convex programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regularizing the abstract convex program
• A simplified test for optimality
• Geometry of optimality conditions and constraint qualifications: The convex case
• On A characterization of optimality in convex programming
• Geometry of optimality conditions and constraint qualifications
• Extremum problems in the presence of restrictions
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development

This page was built for publication: A strengthened test for optimality