Liberating the subgradient optimality conditions from constraint qualifications

DOI10.1007/s10898-006-9003-6zbMath1131.90069MaRDI QIDQ857800

N. E. Zubov

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

zbMATH Keywords

convex optimization; necessary and sufficient conditions; semidefinite programs; sequential optimality conditions; \(\epsilon\)-subdifferentials

Mathematics Subject Classification ID

90C46: Optimality conditions and duality in mathematical programming

Related Items

Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming, Convex inequalities without constraint qualification nor closedness condition, and their applications in 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 composed convex optimization problems, SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS, A closedness condition and its applications to DC programs with convex constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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