-optimality conditions for composed convex optimization problems
DOI10.1016/J.JAT.2008.03.002zbMATH Open1158.46029OpenAlexW2068717261MaRDI QIDQ935086FDOQ935086
Authors: Radu I. Boţ, Ioan Bogdan Hodrea, Gert Wanka 
Publication date: 31 July 2008
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2008.03.002
Recommendations
- Approximate optimality conditions for composite convex optimization problems
- On \(\varepsilon\)-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
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)
Cites Work
- An alternative formulation for a new closed cone constraint qualification
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Title not available (Why is that?)
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- A dual condition for the convex subdifferential sum formula with applications
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Necessary and sufficient conditions for stable conjugate duality
- Semi-continuous mappings in general topology
- Closedness conditions for the optimality of a family of non-convex optimization problems
- A note on subdifferentials of convex composite functionals
- Title not available (Why is that?)
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- On subdifferential calculus for convex functions defined on locally convex spaces.
- Some conjugation formulas and subdifferential formulas of convex analysis revisited
Cited In (15)
- Approximate optimality conditions for composite convex optimization problems
- A note on optimality conditions for DC programs involving composite functions
- Optimality conditions for composite DC infinite programming problems
- An application of the bivariate inf-convolution formula to enlargements of monotone operators
- 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
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- On \(\varepsilon\)-optimality conditions for convex set-valued optimization problems
- 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
- Pareto-Fenchel \({\epsilon}\)-subdifferential composition rule and \({\epsilon}\)-efficiency
- Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus
- 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)
