Characterizations of optimality in convex programming: the nondifferentiable case

DOI10.1080/00036817908839261MaRDI QIDQ4196253zbMATH OpenOpenAlexWikidataFDO

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

Cites work

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3513549 (Why is no real title available?)
• scientific article; zbMATH DE number 3525695 (Why is no real title available?)
• Characterization of optimality in convex programming without a constraint qualification
• Convex Analysis
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• 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

Cited in

(6)

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

This page was built for publication: Characterizations of optimality in convex programming: the nondifferentiable case

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