Approximate optimality conditions for composite convex optimization problems
From MaRDI portal
Recommendations
- Approximate optimality conditions and mixed type duality for composite convex optimization problems
- -optimality conditions for composed convex optimization problems
- Characterizations of \(\epsilon\)-duality gap statements and \(\varepsilon\)-optimality conditions for composite optimization problems with conic constraints
- Approximate optimality and approximate duality in nonsmooth composite vector optimization
- Optimality conditions for composite optimization problems with conical constraints
Cites work
- scientific article; zbMATH DE number 6673745 (Why is no real title available?)
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 6508514 (Why is no real title available?)
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- A closedness condition and its applications to DC programs with convex constraints
- A note on subdifferentials of convex composite functionals
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Farkas-type results for general composed convex optimization problems with inequality constraints
- Generalized Moreau–Rockafellar results for composed convex functions
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- Necessary and sufficient conditions for Farkas' Lemma for cone systems and second-order cone programming duality
- 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
- Strong duality in cone constrained nonconvex optimization
- -optimality conditions for composed convex optimization problems
Cited in
(12)- Characterizations of \(\epsilon\)-duality gap statements and \(\varepsilon\)-optimality conditions for composite optimization problems with conic constraints
- Approximate optimality conditions and mixed type duality for composite convex optimization problems
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- Optimality conditions for composite DC infinite programming problems
- New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
- -optimality conditions for composed convex optimization problems
- Optimality conditions and total dualities for conic programming involving composite function
- Second-order weakly composed adjacent-generalized contingent epiderivatives and applications to composite set-valued optimization problems
- Approximate optimality conditions and sensitivity analysis in nearly convex optimization
- Composite convex programs
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
This page was built for publication: Approximate optimality conditions for composite convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689064)
