An alternative formulation for a new closed cone constraint qualification
From MaRDI portal
Publication:2492444
DOI10.1016/J.NA.2005.06.041zbMATH Open1105.46052OpenAlexW2064099700MaRDI QIDQ2492444FDOQ2492444
Authors: Radu I. Boţ, Gert Wanka 
Publication date: 9 June 2006
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2005.06.041
Recommendations
- Observations of closed cone constraint qualification for quasiconvex programming
- New constraint qualification and conjugate duality for composed convex optimization problems
- Infinite alternative theorems and nonsmooth constraint qualification conditions
- A constraint qualification for convex programming
- Two new weak constraint qualifications and applications
Convex programming (90C25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Convex functions and convex programs in convex geometry (52A41)
Cites Work
- 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
- Generalizations of Slater's constraint qualification for infinite convex programs
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- A dual condition for the convex subdifferential sum formula with applications
- Inequality systems and global optimization
- A simple closure condition for the normal cone intersection formula
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- A Lagrange multiplier theorem and a sandwich theorem for convex relations.
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
- Farkas-Type Results With Conjugate Functions
- Strong duality for generalized convex optimization problems
Cited In (35)
- Lagrange duality for evenly convex optimization problems
- Duality gap of the conic convex constrained optimization problems in normed spaces
- Revisiting some rules of convex analysis
- On strong and total Lagrange duality for convex optimization problems
- The conjugate of the pointwise maximum of two convex functions revisited
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- On set containment characterization and constraint qualification for quasiconvex programming
- Necessary and sufficient constraint qualification for surrogate duality
- Lagrange multipliers and infinite-dimensional equilibrium problems
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- On biconjugates of infimal functions
- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- On constraint qualifications of a nonconvex inequality
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Duality theorems for separable convex programming without qualifications
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- Characterizations via linear scalarization of minimal and properly minimal elements
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Some constraint qualifications for quasiconvex vector-valued systems
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Robust linear semi-infinite programming duality under uncertainty
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- New constraint qualification and conjugate duality for composed convex optimization problems
- Stable zero Lagrange duality for DC conic programming
- A Lagrange duality approach for multi-composed optimization problems
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- A closedness condition and its applications to DC programs with convex constraints
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Asymptotic optimality conditions for linear semi-infinite programming
This page was built for publication: An alternative formulation for a new closed cone constraint qualification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492444)
