-optimality conditions for composed convex optimization problems
From MaRDI portal
(Redirected from Publication:935086)
\(\varepsilon\)-optimality conditions for composed convex optimization problems
\(\varepsilon\)-optimality conditions for composed convex optimization problems
conjugate functions\(\varepsilon\)-optimality conditions\(\varepsilon\)-subdifferentialscomposed convex functions
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Duality theory (optimization) (49N15) Derivatives of functions in infinite-dimensional spaces (46G05)
Recommendations
- Approximate optimality conditions for composite convex optimization problems
- On -optimality conditions for convex set-valued optimization problems
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
- Approximate optimality conditions and mixed type duality for composite convex optimization problems
- Characterizations of \(\epsilon\)-duality gap statements and \(\varepsilon\)-optimality conditions for composite optimization problems with conic constraints
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- Composed convex programming: duality and Farkas-type results
- scientific article; zbMATH DE number 5992448
- Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
- Optimality conditions for composite optimization problems with conical constraints
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 734672 (Why is no real title available?)
- A dual condition for the convex subdifferential sum formula with applications
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- A note on subdifferentials of convex composite functionals
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- An alternative formulation for a new closed cone constraint qualification
- Closedness conditions for the optimality of a family of non-convex optimization problems
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Necessary and sufficient conditions for stable conjugate duality
- On subdifferential calculus for convex functions defined on locally convex spaces.
- Semi-continuous mappings in general topology
- Some conjugation formulas and subdifferential formulas of convex analysis revisited
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
Cited in
(15)- Approximate optimality conditions for composite convex optimization problems
- A note on optimality conditions for DC programs involving composite functions
- An application of the bivariate inf-convolution formula to enlargements of monotone operators
- Optimality conditions for composite DC infinite programming problems
- Duality and \(\varepsilon \)-optimality conditions for multi-composed optimization problems with applications to fractional and entropy optimization
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
- Optimality conditions for vector optimization problems with difference of convex maps
- On -optimality conditions for convex set-valued optimization problems
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
- On the optimality conditions for D.C. vector optimization problems
- Duality for -variational inequalities via the subdifferential calculus
- Pareto-Fenchel \({\epsilon}\)-subdifferential composition rule and \({\epsilon}\)-efficiency
- Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems
- A Lagrange duality approach for multi-composed optimization problems
This page was built for publication: \(\varepsilon\)-optimality conditions for composed convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935086)
