Qualification and optimality conditions for dc programs with infinite constraints
From MaRDI portal
Publication:2390727
zbMath1190.90264MaRDI QIDQ2390727
Publication date: 3 August 2009
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Related Items (32)
The stable duality of DC programs for composite convex functions ⋮ From quasidifferentiable to directed subdifferentiable functions: exact calculus rules ⋮ Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Normal subdifferentials of efficient point multifunctions in parametric vector optimization ⋮ Clarke coderivatives of efficient point multifunctions in parametric vector optimization ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Robust conjugate duality for convex optimization under uncertainty with application to data classification ⋮ Duality for minimization of the difference of two \(\Phi_c\)-convex functions ⋮ Derivatives of the efficient point multifunction in parametric vector optimization problems ⋮ Stable zero Lagrange duality for DC conic programming ⋮ Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ Isolated and proper efficiencies in semi-infinite vector optimization problems ⋮ On Computing the Mordukhovich Subdifferential Using Directed Sets in Two Dimensions ⋮ Optimality Conditions for a Simple Convex Bilevel Programming Problem ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Nonsmooth semi-infinite multiobjective optimization problems ⋮ Generalized Clarke epiderivatives of parametric vector optimization problems ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Simple bilevel programming and extensions ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions ⋮ A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps ⋮ Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming
This page was built for publication: Qualification and optimality conditions for dc programs with infinite constraints
