Optimality conditions and total dualities for conic programming involving composite function
From MaRDI portal
Publication:5213372
Recommendations
- Optimality conditions for composite optimization problems with conical constraints
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- \( \epsilon \)-optimality conditions and \(\epsilon \)-saddle point theorems for robust conical programming problems
- scientific article; zbMATH DE number 7448122
- Characterizations of \(\epsilon\)-duality gap statements and \(\varepsilon\)-optimality conditions for composite optimization problems with conic constraints
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- A closedness condition and its applications to DC programs with convex constraints
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Approximate optimality conditions for composite convex optimization problems
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- DC programming: overview.
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Duality gap of the conic convex constrained optimization problems in normed spaces
- Extended Farkas lemma and strong duality for composite optimization problems with DC functions
- Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Farkas-type results and duality for DC programs with convex constraints
- Farkas-type results for vector-valued functions with applications
- From the Farkas lemma to the Hahn-Banach theorem
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Functional inequalities and theorems of the alternative involving composite functions
- Generalized Moreau–Rockafellar results for composed convex functions
- Incremental gradient projection algorithm for constrained composite minimization problems
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Local and global optimality conditions for dc infinite optimization problems
- New constraint qualification and conjugate duality for composed convex optimization problems
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- On Zero Duality Gap and the Farkas Lemma for Conic Programming
- On minima of the difference of functions
- On strong and total Lagrange duality for convex optimization problems
- Qualification and optimality conditions for dc programs with infinite constraints
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- The strong duality for DC optimization problems with composite convex functions
- Total Lagrange duality for DC infinite optimization problems
Cited in
(10)- Optimality conditions for composite optimization problems with conical constraints
- New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems
- Optimality conditions for composite DC infinite programming problems
- Some new Farkas-type results for inequality systems with DC functions
- Robust optimality conditions for DC programming problem with conic inequality constraints
- \( \epsilon \)-optimality conditions and \(\epsilon \)-saddle point theorems for robust conical programming problems
- On constraint qualifications for an infinite system of quasiconvex inequalities
- Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems
- Duality for minimization of the difference of two \(\Phi_c\)-convex functions
- scientific article; zbMATH DE number 6500589 (Why is no real title available?)
This page was built for publication: Optimality conditions and total dualities for conic programming involving composite function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5213372)
