Fenchel-Lagrange duality for DC infinite programs with inequality constraints
From MaRDI portal
Publication:2656086
DOI10.1016/j.cam.2021.113426zbMath1481.90264OpenAlexW3121290959MaRDI QIDQ2656086
Publication date: 10 March 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2021.113426
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (2)
Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems ⋮ Optimality conditions for composite DC infinite programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
- Some new Farkas-type results for inequality systems with DC functions
- Duality in D. C. programming: The case of several D. C. constraints
- Approximate optimality conditions for composite convex optimization problems
- A note on optimality conditions for DC programs involving composite functions
- Inequality systems and global optimization
- A note on subdifferentials of convex composite functionals
- Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- The stable duality of DC programs for composite convex functions
- Farkas-type results for fractional programming problems
- Qualification and optimality conditions for dc programs with infinite constraints
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- On strong and total Lagrange duality for convex optimization problems
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Extended Farkas lemma and strong duality for composite optimization problems with DC functions
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex 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
- Some characterizations of duality for DC optimization with composite functions
- Farkas-Type results for general composed convex optimization problems with inequality constraints
This page was built for publication: Fenchel-Lagrange duality for DC infinite programs with inequality constraints
