Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
From MaRDI portal
Publication:984086
DOI10.1016/j.na.2010.04.020zbMath1218.90200OpenAlexW2048105128MaRDI QIDQ984086
Chong Li, Ng Kung-fu, Dong Hui Fang
Publication date: 13 July 2010
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.2010.04.020
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Approximation with constraints (41A29) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)
Related Items
Stable and total Fenchel duality for composed convex optimization problems, Some characterizations of robust optimal solutions for uncertain convex optimization problems, Some characterizations of duality for DC optimization with composite functions, Some characterizations of approximate solutions for robust semi-infinite optimization problems, A Lagrange duality approach for multi-composed optimization problems, Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization, Recent contributions to linear semi-infinite optimization, Total Lagrange duality for DC infinite optimization problems, Weighted robust optimality of convex optimization problems with data uncertainty, Stationarity and regularity of infinite collections of sets, Stable zero Lagrange duality for DC conic programming, Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems, Unnamed Item, Recent contributions to linear semi-infinite optimization: an update, Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function, Optimality conditions for nonlinear infinite programming problems, Extended Farkas's lemmas and strong dualities for conic programming involving composite functions, Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems, On constraint qualifications of a nonconvex inequality, Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings, Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization, Optimality conditions and total dualities for conic programming involving composite function, Strong and total Lagrange dualities for quasiconvex programming, Strong and total Lagrange dualities for quasiconvex programming, Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Liberating the subgradient optimality conditions from constraint qualifications
- Some new Farkas-type results for inequality systems with DC functions
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Duality gap of the conic convex constrained optimization problems in normed spaces
- Recent contributions to linear semi-infinite optimization
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- On best uniform restricted range approximation in complex-valued continuous function spaces.
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Qualification and optimality conditions for dc programs with infinite constraints
- On strong and total Lagrange duality for convex optimization problems
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- The strong conical hull intersection property for convex programming
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- An alternative formulation for a new closed cone constraint qualification
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- On best restricted range approximation in continuous complex-valued function spaces
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- On the Stability of the Feasible Set in Optimization Problems
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- New Farkas-type constraint qualifications in convex infinite programming
- A Global Approach to Nonlinearly Constrained Best Approximation
- Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
