Optimality conditions and total dualities for conic programming involving composite function
From MaRDI portal
Publication:5213372
DOI10.1080/02331934.2018.1561695zbMath1436.90151OpenAlexW2908658224MaRDI QIDQ5213372
Publication date: 3 February 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1561695
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items (4)
Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems ⋮ New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Duality for minimization of the difference of two \(\Phi_c\)-convex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Total Lagrange duality for DC infinite optimization problems
- Local and global optimality conditions for dc infinite optimization problems
- Functional inequalities and theorems of the alternative involving composite functions
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Duality gap of the conic convex constrained optimization problems in normed spaces
- On minima of the difference of functions
- Approximate optimality conditions for composite convex optimization problems
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- DC programming: overview.
- Farkas-type results for vector-valued functions with applications
- Qualification and optimality conditions for dc programs with infinite constraints
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- New constraint qualification and conjugate duality for composed convex optimization problems
- On strong and total Lagrange duality for convex optimization problems
- Extended Farkas lemma and strong duality for composite optimization problems with DC functions
- On Zero Duality Gap and the Farkas Lemma for Conic Programming
- From the Farkas Lemma to the Hahn--Banach Theorem
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- A closedness condition and its applications to DC programs with convex constraints
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Generalized Moreau–Rockafellar results for composed convex functions
This page was built for publication: Optimality conditions and total dualities for conic programming involving composite function
