Characterizations of optimality in convex programming: the nondifferentiable case

DOI10.1080/00036817908839261zbMATH Open0408.90068OpenAlexW4252023873WikidataQ58272069 ScholiaQ58272069MaRDI QIDQ4196253FDOQ4196253

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

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

Cited In (6)

• Regularizing the abstract convex program
• Method of reduction in convex programming
• A note on multiple optimality conditions for programs with convex inequality constraints
• 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
• Geometry of optimality conditions and constraint qualifications: The convex case

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)