Liberating the subgradient optimality conditions from constraint qualifications
From MaRDI portal
Recommendations
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- scientific article; zbMATH DE number 5245384
- scientific article; zbMATH DE number 5662944
- On sequential optimality theorems for convex optimization problems
- scientific article; zbMATH DE number 5824228
Cites work
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 1552291 (Why is no real title available?)
- scientific article; zbMATH DE number 887371 (Why is no real title available?)
- A dual condition for the convex subdifferential sum formula with applications
- A simple constraint qualification in infinite dimensional programming
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Duality and infinite dimensional optimization
- Generalizations of Slater's constraint qualification for infinite convex programs
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On the Subdifferentiability of Convex Functions
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Subdifferential calculus using -subdifferentials
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
Cited in
(19)- Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem
- A note on optimality conditions for DC programs involving composite functions
- Necessary and sufficient conditions for S-lemma and~nonconvex quadratic optimization
- Sequential approximate optimality conditions for a constrained convex vector minimization problem and application to multiobjective fractional programming problem
- Sequential optimality conditions for composed convex optimization problems
- Farkas' lemma: three decades of generalizations for mathematical optimization
- On -optimality conditions for multiobjective fractional optimization problems
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- Sequential optimality conditions for multiobjective fractional programming problems
- Duality for constrained robust sum optimization problems
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1]
- Duality and optimality conditions for generalized equilibrium problems involving DC functions
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Sequential efficiency optimality conditions for robust multiobjective fractional optimization problems
- Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
- A closedness condition and its applications to DC programs with convex constraints
This page was built for publication: Liberating the subgradient optimality conditions from constraint qualifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857800)
