Geometry of optimality conditions and constraint qualifications: The convex case
From MaRDI portal
Publication:3877415
Cites work
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3718856 (Why is no real title available?)
- scientific article; zbMATH DE number 3594153 (Why is no real title available?)
- scientific article; zbMATH DE number 3630489 (Why is no real title available?)
- scientific article; zbMATH DE number 3291743 (Why is no real title available?)
- scientific article; zbMATH DE number 3399051 (Why is no real title available?)
- A Necessary and Sufficient Qualification for Constrained Optimization
- A course on optimization and best approximation
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- A simplified test for optimality
- Calculating the cone of directions of constancy
- Characterization of optimality in convex programming without a constraint qualification
- Characterizations of optimality in convex programming: the nondifferentiable case
- Characterizations of optimality without constraint qualification for the abstract convex program
- Constraint Qualifications Revisited
- Constraint qualifications in maximization problems
- Convex Analysis
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Feasible direction methods in the absence of slater's condition
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Geometry of optimality conditions and constraint qualifications
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification
- Optimality condition: Constraint regularization
- Optimality conditions for convex semi-infinite programming problems
- Proper Efficient Points for Maximizations with Respect to Cones
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Stability property of a system of inequalities
Cited in
(13)- 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
- A simple constraint qualification in convex programming
- A new dual problem for nondifferentiable 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
- A strengthened test for optimality
- Necessary and sufficient conditions for regularity of constraints in convex programming
- Numerical decomposition of a convex function
- Una caracterización dual de optimalidad para optimización convexa
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)
