Optimality conditions of quasi (\alpha,\varepsilon)-solutions and approximate mixed type duality for DC composite optimization problems

Cites Work

Title not available (Why is that?)
On $\epsilon$-solutions for convex optimization problems with uncertainty data
ε-Optimal solutions in nondifferentiable convex programming and some related questions
Extended Farkas lemma and strong duality for composite optimization problems with DC functions
Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
A closedness condition and its applications to DC programs with convex constraints
Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
Fenchel-Lagrange duality for DC infinite programs with inequality constraints
On quasi $\epsilon$-solution for robust convex optimization problems
Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
Necessary optimality conditions for DC infinite programs with inequality constraints
$\varepsilon$-optimality conditions for composed convex optimization problems
Generalized Moreau–Rockafellar results for composed convex functions
Optimality conditions and total dualities for conic programming involving composite function
Approximate optimality conditions and mixed type duality for composite convex optimization problems
Some characterizations of approximate solutions for robust semi-infinite optimization problems
Some characterizations of duality for DC optimization with composite functions
$ \epsilon $-optimality conditions and $\epsilon $-saddle point theorems for robust conical programming problems

This page was built for publication: Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058178)