Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization

DOI10.1007/s11228-010-0166-4zbMath1231.90381OpenAlexW2103372919MaRDI QIDQ618891

Sumit K. Garg

Publication date: 17 January 2011

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10045/15407

zbMATH Keywords

convex programmingsubdifferentialconstraint qualificationDCconvex inequalitiesFarkas-type lemmassemi-definite optimization

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)

Related Items (9)

Farkas-type results for vector-valued functions with applications ⋮ Recent contributions to linear semi-infinite optimization ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ On epsilon-stability in optimization ⋮ Asymptotic optimality conditions for linear semi-infinite programming ⋮ Functional inequalities and theorems of the alternative involving composite functions ⋮ An approximate Hahn–Banach theorem for positively homogeneous functions ⋮ Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Liberating the subgradient optimality conditions from constraint qualifications
• Some new Farkas-type results for inequality systems with DC functions
• Semi-continuous mappings in general topology
• Subdifferential calculus using \(\varepsilon\)-subdifferentials
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• Inequality systems and global optimization
• Characterizing global optimality for DC optimization problems under convex inequality constraints
• Dual characterizations of set containments with strict convex inequalities
• Lectures on Modern Convex Optimization
• 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
• Extended Active Constraints in Linear Optimization with Applications
• Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
• Farkas-Type Results With Conjugate Functions
• Unilateral Analysis and Duality

This page was built for publication: Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization