Farkas-type results for general composed convex optimization problems with inequality constraints
From MaRDI portal
Publication:5189752
Recommendations
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Composed convex programming: duality and Farkas-type results
- Farkas-Type Results With Conjugate Functions
- Farkas-type results and duality for DC programs with convex constraints
- New constraint qualification and conjugate duality for composed convex optimization problems
Cited in
(10)- Functional inequalities and theorems of the alternative involving composite functions
- Farkas-type results with conjugate functions in infinite-dimensional setting
- Composed convex programming: duality and Farkas-type results
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints
- Approximate optimality conditions for composite convex optimization problems
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Farkas' lemma: three decades of generalizations for mathematical optimization
- New constraint qualification and conjugate duality for composed convex optimization problems
- Farkas-Type Results With Conjugate Functions
- Some dual characterizations of Farkas-type results for fractional programming problems
This page was built for publication: Farkas-type results for general composed convex optimization problems with inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189752)