On A characterization of optimality in convex programming

DOI10.1007/BF01580372zbMATH Open0352.90048OpenAlexW1971344796MaRDI QIDQ4123086FDOQ4123086

Authors Adi Ben-Israel, Aharon Ben-Tal

Publication date 1976

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25)

Cites work

• scientific article; zbMATH DE number 3399051 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• Characterization of optimality in convex programming without a constraint qualification
• Ordinary convex programs without a duality gap
• Seven Kinds of Convexity

Cited in

(7)

• On optimality in abstract convex programming
• Relación entre conos de direcciones decrecientes y conos de direcciones de descenso
• A simplified test for optimality
• Finite dimensional second order optimality conditions
• Complete characterization of optimality for convex programming in banach spaces^†
• A strengthened test for optimality
• Calculating the cone of directions of constancy

This page was built for publication: On A characterization of optimality in convex programming

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