A strengthened test for optimality

DOI10.1007/BF00934929zbMATH Open0473.90066OpenAlexW2072584575MaRDI QIDQ1159136FDOQ1159136

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

• Title not available (Why is that?)
• Regularizing the abstract convex program
• Extremum problems in the presence of restrictions
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Title not available (Why is that?)
• A simplified test for optimality
• Geometry of optimality conditions and constraint qualifications: The convex case
• Geometry of optimality conditions and constraint qualifications
• Title not available (Why is that?)
• Title not available (Why is that?)
• On A characterization of optimality in convex programming

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)