Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
DOI10.1007/S11228-010-0166-4zbMATH Open1231.90381OpenAlexW2103372919MaRDI QIDQ618891FDOQ618891
Authors: 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
Recommendations
- Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- scientific article; zbMATH DE number 3847230
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
convex programmingsubdifferentialDCconstraint qualificationconvex inequalitiesFarkas-type lemmassemi-definite optimization
Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)
Cites Work
- Title not available (Why is that?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Farkas-type results and duality for DC programs with convex constraints
- Some new Farkas-type results for inequality systems with DC functions
- Inequality systems and global optimization
- Semi-continuous mappings in general topology
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Liberating the subgradient optimality conditions from constraint qualifications
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Dual characterizations of set containments with strict convex inequalities
- Extended Active Constraints in Linear Optimization with Applications
- Complements on subdifferential calculus
- Farkas-Type Results With Conjugate Functions
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unilateral Analysis and Duality
Cited In (10)
- Farkas-type results for vector-valued functions with applications
- On epsilon-stability in optimization
- Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- An approximate Hahn-Banach theorem for positively homogeneous functions
- Functional inequalities and theorems of the alternative involving composite functions
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Asymptotic optimality conditions for linear semi-infinite programming
This page was built for publication: Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618891)
