A strengthened test for optimality

DOI10.1007/BF00934929MaRDI QIDQ1159136zbMATH OpenOpenAlexFDO

Authors 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 multipliersgradientsequality constraintssolution 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)

Cites work

• scientific article; zbMATH DE number 3718856 (Why is no real title available?)
• scientific article; zbMATH DE number 3737415 (Why is no real title available?)
• scientific article; zbMATH DE number 3525695 (Why is no real title available?)
• scientific article; zbMATH DE number 3399051 (Why is no real title available?)
• A simplified test for optimality
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Extremum problems in the presence of restrictions
• Geometry of optimality conditions and constraint qualifications
• Geometry of optimality conditions and constraint qualifications: The convex case
• On A characterization of optimality in convex programming
• Regularizing the abstract convex program

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159136)