Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
From MaRDI portal
(Redirected from Publication:984086)
Recommendations
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Total Lagrange duality for DC infinite optimization problems
- Strong and total Lagrange dualities for quasiconvex programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- New Farkas-type constraint qualifications in convex infinite programming
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- A Global Approach to Nonlinearly Constrained Best Approximation
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- An alternative formulation for a new closed cone constraint qualification
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Constraint qualifications for semi-infinite systems of convex inequalities
- Duality gap of the conic convex constrained optimization problems in normed spaces
- Farkas-type results and duality for DC programs with convex constraints
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- From linear to convex systems: consistency, Farkas' lemma and applications
- Liberating the subgradient optimality conditions from constraint qualifications
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- New Farkas-type constraint qualifications in convex infinite programming
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- On best restricted range approximation in continuous complex-valued function spaces
- On best uniform restricted range approximation in complex-valued continuous function spaces.
- On strong and total Lagrange duality for convex optimization problems
- On the Stability of the Feasible Set in Optimization Problems
- Qualification and optimality conditions for dc programs with infinite constraints
- Recent contributions to linear semi-infinite optimization
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Some new Farkas-type results for inequality systems with DC functions
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- The strong conical hull intersection property for convex programming
Cited in
(40)- Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings
- Constraint qualifications and Farkas lemma in convex infinite programming
- Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
- scientific article; zbMATH DE number 5662944 (Why is no real title available?)
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- A simple constraint qualification in infinite dimensional programming
- scientific article; zbMATH DE number 2158983 (Why is no real title available?)
- Optimality conditions for nonlinear infinite programming problems
- On constraint qualifications of a nonconvex inequality
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- Generalizations of Slater's constraint qualification for infinite convex programs
- Approximate optimality conditions and mixed type duality for a class of non-convex optimization problems
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- On global error bounds for convex inequalities systems
- Alternative KKT conditions for (semi)infinite convex optimization
- New Farkas-type constraint qualifications in convex infinite programming
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Some characterizations of duality for DC optimization with composite functions
- Total Lagrange duality for DC infinite optimization problems
- Optimality conditions and total dualities for conic programming involving composite function
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- A Two-Riccati, Feasible Algorithm for Guaranteeing Output L∞ Constraints
- Constraint qualification with Schauder basis for infinite programming problems
- Stable zero Lagrange duality for DC conic programming
- On constraint qualifications for an infinite system of quasiconvex inequalities
- Recent contributions to linear semi-infinite optimization
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Strong and total Lagrange dualities for quasiconvex programming
- Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- A Lagrange duality approach for multi-composed optimization problems
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Stable and total Fenchel duality for composed convex optimization problems
- Weighted robust optimality of convex optimization problems with data uncertainty
- Recent contributions to linear semi-infinite optimization: an update
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- Strong and total Lagrange dualities for quasiconvex programming
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Stationarity and regularity of infinite collections of sets
This page was built for publication: Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984086)
