Characterizations of -duality gap statements for composed optimization problems
From MaRDI portal
Publication:2254297
Recommendations
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- Characterizations of -duality gap statements and -optimality conditions for composite optimization problems with conic constraints
- -optimality conditions for composed convex optimization problems
- scientific article; zbMATH DE number 6500589
- Zero duality gap property for convex composite optimization problems
- On the relations between different duals assigned to composed optimization problems
- Composed convex programming: duality and Farkas-type results
- Duality for composite optimization problem within the framework of abstract convexity
- Duality and -optimality conditions for multi-composed optimization problems with applications to fractional and entropy optimization
- Duality gap in differentiable and nondifferentiable optimization problems
Cites work
- -optimality conditions for composed convex optimization problems
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- A note on subdifferentials of convex composite functionals
- Approximations in Dynamic Zero-Sum Games II
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- Composed convex programming: duality and Farkas-type results
- Conjugate duality in convex optimization
- Duality in Vector Optimization
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Generalized Moreau–Rockafellar results for composed convex functions
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1328981 (Why is no real title available?)
- scientific article; zbMATH DE number 734672 (Why is no real title available?)
- scientific article; zbMATH DE number 2152227 (Why is no real title available?)
- Lower semicontinuous type regularity conditions for subdifferential calculus
- New constraint qualification and conjugate duality for composed convex optimization problems
- New regularity conditions for Lagrange and Fenchel-Lagrange duality in infinite dimensional spaces
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- On \(\varepsilon\)-approximate solutions for convex semidefinite optimization problems
- On strong and total Lagrange duality for convex optimization problems
- On subdifferential calculus for convex functions defined on locally convex spaces.
Cited in
(8)- Stable and total Fenchel duality for composed convex optimization problems
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- scientific article; zbMATH DE number 6500589 (Why is no real title available?)
- Characterizations of -duality gap statements and -optimality conditions for composite optimization problems with conic constraints
- Duality and -optimality conditions for multi-composed optimization problems with applications to fractional and entropy optimization
- Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces
- On epsilon-stability in optimization
- -optimality conditions for composed convex optimization problems
This page was built for publication: Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254297)
