Farkas-type results for inequality systems with composed convex functions via conjugate duality
From MaRDI portal
Publication:2497401
Recommendations
- Farkas-type results for general composed convex optimization problems with inequality constraints
- Farkas-Type Results With Conjugate Functions
- Composed convex programming: duality and Farkas-type results
- Some new Farkas-type results for inequality systems with DC functions
- Farkas-type results with conjugate functions in infinite-dimensional setting
Cites work
- scientific article; zbMATH DE number 3927769 (Why is no real title available?)
- scientific article; zbMATH DE number 3595790 (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 3320765 (Why is no real title available?)
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Composite Nonsmooth Programming with Gâteaux Differentiability
- Convex composite minimization with \(C^{1,1}\) functions
- Farkas-Type Results With Conjugate Functions
- First and second-order optimality conditions for convex composite multiobjective optimization
- New constraint qualification and conjugate duality for composed convex optimization problems
- New formulas for the Legendre-Fenchel transform.
- Strong duality for generalized convex optimization problems
Cited in
(24)- Composed convex programming: duality and Farkas-type results
- A new approach to strong duality for composite vector optimization problems
- Farkas-type results for fractional programming problems
- Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints
- The stable duality of DC programs for composite convex functions
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
- A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Farkas-type results with conjugate functions in infinite-dimensional setting
- High-order optimization methods for fully composite problems
- Functional inequalities and theorems of the alternative involving composite functions
- -optimality conditions for composed convex optimization problems
- Farkas-Type Results With Conjugate Functions
- A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function
- Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
- Some Farkas-type results for fractional programming problems with DC functions
- A note on the K-epigraph
- New constraint qualification and conjugate duality for composed convex optimization problems
- Farkas-type results for general composed convex optimization problems with inequality constraints
- Duality and Farkas-type results for DC fractional programming with DC constraints
- A study of convex convex-composite functions via infimal convolution with applications
This page was built for publication: Farkas-type results for inequality systems with composed convex functions via conjugate duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497401)
