Qualification and optimality conditions for dc programs with infinite constraints
From MaRDI portal
Publication:2390727
Recommendations
- Optimality conditions for convex and DC infinite optimization problems
- Optimality conditions in DC-constrained mathematical programming problems
- Necessary optimality conditions for DC infinite programs with inequality constraints
- Local and global optimality conditions for dc infinite optimization problems
- A necessary and sufficient constraint qualification for DC programming problems with convex inequality constraints
Cited in
(42)- On computing the Mordukhovich subdifferential using directed sets in two dimensions
- Optimality conditions in DC-constrained mathematical programming problems
- A note on optimality conditions for DC programs involving composite functions
- Normal subdifferentials of efficient point multifunctions in parametric vector optimization
- Approximate optimality conditions and stopping criteria in canonical DC programming
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints
- Local and global optimality conditions for dc infinite optimization problems
- The stable duality of DC programs for composite convex functions
- Generalized Clarke epiderivatives of parametric vector optimization problems
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
- Derivatives of the efficient point multifunction in parametric vector optimization problems
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- A necessary and sufficient constraint qualification for DC programming problems with convex inequality constraints
- Simple bilevel programming and extensions
- Optimality conditions for convex and DC infinite optimization problems
- New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
- Necessary optimality conditions for DC infinite programs with inequality constraints
- Robust optimality conditions for DC programming problem with conic inequality constraints
- DC Programming Approaches for BMI and QMI Feasibility Problems
- A difference of convex and polyhedral convex functions programming problem
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Total Lagrange duality for DC infinite optimization problems
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- Optimality conditions and total dualities for conic programming involving composite function
- On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Multiobjective DC programs with infinite convex constraints
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Stable zero Lagrange duality for DC conic programming
- Clarke coderivatives of efficient point multifunctions in parametric vector optimization
- Duality for minimization of the difference of two \(\Phi_c\)-convex functions
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
- Nonsmooth semi-infinite multiobjective optimization problems
- A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
This page was built for publication: Qualification and optimality conditions for dc programs with infinite constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390727)
