Geometry of optimality conditions and constraint qualifications: The convex case

Cites Work

Convex Analysis
Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
A course on optimization and best approximation
Title not available (Why is that?)
Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
Proper Efficient Points for Maximizations with Respect to Cones
Stability Theory for Systems of Inequalities. Part I: Linear Systems
Title not available (Why is that?)
Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
Title not available (Why is that?)
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
Constraint qualifications in maximization problems
Constraint Qualifications Revisited
A Necessary and Sufficient Qualification for Constrained Optimization
Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification
A simplified test for optimality
Optimality conditions for convex semi-infinite programming problems
Characterizations of optimality without constraint qualification for the abstract convex program
Geometry of optimality conditions and constraint qualifications
Characterization of optimality in convex programming without a constraint qualification
Calculating the cone of directions of constancy
Characterizations of optimality in convex programming: the nondifferentiable case
Stability property of a system of inequalities
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Feasible direction methods in the absence of slater's condition
Optimality condition: Constraint regularization

Cited In (13)

Abstract cone approximations and generalized differentiability in nonsmooth optimization
On constraint qualifications in nonsmooth optimization.
A strengthened test for optimality
A simple constraint qualification in convex programming
Necessary and sufficient conditions for regularity of constraints in convex programming
A constraint qualification for convex programming
Regularizing the abstract convex program
Method of reduction in convex programming
Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
Relación entre conos de direcciones decrecientes y conos de direcciones de descenso
Numerical decomposition of a convex function
Una caracterización dual de optimalidad para optimización convexa
A new dual problem for nondifferentiable convex programming

This page was built for publication: Geometry of optimality conditions and constraint qualifications: The convex case

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