Approximate optimality conditions for composite convex optimization problems
From MaRDI portal
Publication:1689064
DOI10.1007/s40305-016-0140-4zbMath1386.90106OpenAlexW2548421223MaRDI QIDQ1689064
Xian-Jun Long, Zai-Yun Peng, Xiang-Kai Sun
Publication date: 12 January 2018
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-016-0140-4
\(\varepsilon \)-subdifferentialapproximate optimality conditioncomposite convex optimization problemgeneralized regularity condition
Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (6)
Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions ⋮ Second-order weakly composed adjacent-generalized contingent epiderivatives and applications to composite set-valued optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- A note on subdifferentials of convex composite functionals
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Existence and optimality conditions for approximate solutions to vector optimization problems
- New constraint qualification and conjugate duality for composed convex optimization problems
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- A closedness condition and its applications to DC programs with convex constraints
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Generalized Moreau–Rockafellar results for composed convex functions
- Farkas-Type results for general composed convex optimization problems with inequality constraints
- Strong Duality in Cone Constrained Nonconvex Optimization
This page was built for publication: Approximate optimality conditions for composite convex optimization problems
