Characterizations of optimality in convex programming: the nondifferentiable case

DOI10.1080/00036817908839261zbMath0408.90068OpenAlexW4252023873WikidataQ58272069 ScholiaQ58272069MaRDI QIDQ4196253

Aharon Ben-Tal, Adi Ben-Israel

Publication date: 1979

Published in: Applicable Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00036817908839261

zbMATH Keywords

SubdifferentialsSaddle PointsNondifferentiable Convex ProgrammingPrimal and Dual Characterizations

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Una caracterización dual de optimalidad para optimización convexa, Regularizing the abstract convex program, A note on multiple optimality conditions for programs with convex inequality constraints, Method of reduction in convex programming, Geometry of optimality conditions and constraint qualifications: The convex case, A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes

Cites Work

• Characterization of optimality in convex programming without a constraint qualification
• Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
• Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming
• Convex Analysis
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Unnamed Item
• Unnamed Item
• Unnamed Item