New constraint qualification and conjugate duality for composed convex optimization problems
From MaRDI portal
Recommendations
- Stable and total Fenchel duality for composed convex optimization problems
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Study on the Lagrange dualities for composite optimization problems with conical constraints
- Composed convex programming: duality and Farkas-type results
- Farkas-type results for general composed convex optimization problems with inequality constraints
Cites work
- An alternative formulation for a new closed cone constraint qualification
- Convex Analysis
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Farkas-Type Results With Conjugate Functions
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- scientific article; zbMATH DE number 3927769 (Why is no real title available?)
- scientific article; zbMATH DE number 3606241 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 734672 (Why is no real title available?)
- scientific article; zbMATH DE number 2096862 (Why is no real title available?)
- scientific article; zbMATH DE number 1393065 (Why is no real title available?)
- New formulas for the Legendre-Fenchel transform.
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- On subdifferential calculus for convex functions defined on locally convex spaces.
- Some applications of optimization in matrix theory
- Strong duality for generalized convex optimization problems
Cited in
(38)- Conjugate duality in vector optimization and some applications to the vector variational inequality
- Stable and total Fenchel duality for composed convex optimization problems
- Approximate optimality conditions for composite convex optimization problems
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Multiobjective duality for convex ratios.
- Qualification conditions-free characterizations of the \(\varepsilon \)-subdifferential of convex integral functions
- Second-order weakly composed adjacent-generalized contingent epiderivatives and applications to composite set-valued optimization problems
- Perturbation of image and conjugate duality for vector optimization
- Higher-order generalized tangent epiderivatives and applications to set-valued optimization
- A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
- Farkas-type results for fractional programming problems
- Conjugate dual problems in constrained set-valued optimization and applications
- A Lagrange duality approach for multi-composed optimization problems
- Characterizations of the subdifferential of convex integral functions under qualification conditions
- A general approach for studying duality in multiobjective optimization
- An alternative formulation for a new closed cone constraint qualification
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Stochastic retarded inclusion with Carathéodory-upper separated multifunctions
- The Fenchel-Lagrange dual of generalized convex optimization problem
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Farkas' lemma: three decades of generalizations for mathematical optimization
- A new approach to strong duality for composite vector optimization problems
- A study of convex convex-composite functions via infimal convolution with applications
- Farkas-type results for general composed convex optimization problems with inequality constraints
- Optimality conditions and total dualities for conic programming involving composite function
- scientific article; zbMATH DE number 6453520 (Why is no real title available?)
- Composed convex programming: duality and Farkas-type results
- Optimization problems in statistical learning: duality and optimality conditions
- Duality and Farkas-type results for DC fractional programming with DC constraints
- High-order optimization methods for fully composite problems
- A note on the K-epigraph
- Strong and total duality for constrained composed optimization via a coupling conjugation scheme
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- Duality for location problems with unbounded unit balls
- Saddle points and gap functions for vector equilibrium problems via conjugate duality in vector optimization
- Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
This page was built for publication: New constraint qualification and conjugate duality for composed convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465467)
