Liberating the subgradient optimality conditions from constraint qualifications
From MaRDI portal
Publication:857800
DOI10.1007/s10898-006-9003-6zbMath1131.90069OpenAlexW1968747019MaRDI QIDQ857800
Publication date: 5 January 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9003-6
convex optimizationnecessary and sufficient conditionssemidefinite programssequential optimality conditions\(\epsilon\)-subdifferentials
Related Items (17)
Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1] ⋮ Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization ⋮ Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem ⋮ SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS ⋮ On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ Duality for constrained robust sum optimization problems ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ Sequential optimality conditions for composed convex optimization problems ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ 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 multiobjective fractional programming problems ⋮ Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
Cites Work
- Generalizations of Slater's constraint qualification for infinite convex programs
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- A simple constraint qualification in infinite dimensional programming
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Duality and infinite dimensional optimization
- On the Subdifferentiability of Convex Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Liberating the subgradient optimality conditions from constraint qualifications
