Geometry of optimality conditions and constraint qualifications: The convex case
From MaRDI portal
Publication:3877415
DOI10.1007/BF01581627zbMath0436.90082MaRDI QIDQ3877415
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
regularizationconstraint qualificationssubgradientsdirections of constancygeometry of optimality conditions
Related Items
Una caracterización dual de optimalidad para optimización convexa, Necessary and sufficient conditions for regularity of constraints in convex programming, Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications, Regularizing the abstract convex program, A strengthened test for optimality, Method of reduction in convex programming, Abstract cone approximations and generalized differentiability in nonsmooth optimization, On constraint qualifications in nonsmooth optimization., Relación entre conos de direcciones decrecientes y conos de direcciones de descenso, A constraint qualification for convex programming, Numerical decomposition of a convex function, A simple constraint qualification in convex programming, A new dual problem for nondifferentiable convex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of optimality in convex programming without a constraint qualification
- A simplified test for optimality
- Calculating the cone of directions of constancy
- Stability property of a system of inequalities
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- A course on optimization and best approximation
- Optimality conditions for convex semi-infinite programming problems
- Characterizations of optimality without constraint qualification for the abstract convex program
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- Proper Efficient Points for Maximizations with Respect to Cones
- Optimality condition: Constraint regularization
- Feasible direction methods in the absence of slater's condition
- Characterizations of optimality in convex programming: the nondifferentiable case
- Geometry of optimality conditions and constraint qualifications
- Constraint qualifications in maximization problems
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Convex Analysis
- A Necessary and Sufficient Qualification for Constrained Optimization
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Constraint Qualifications Revisited
