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

DOI10.23952/JNVA.7.2023.1.08MaRDI QIDQ5058178zbMATH OpenOpenAlexFDO

Authors Jiaolang Wang, Ching-Feng Wen, D. H. Fang, Xian-Yun Wang

Publication date 19 December 2022

Published in Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.23952/jnva.7.2023.1.08

zbMATH Keywords

constraint qualificationmixed type dualityapproximate optimality conditionDC composite optimization problem

Mathematics Subject Classification ID

Functional analysis (46-XX) Operator theory (47-XX)

Cites work

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

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)