Optimality conditions for DC programming problems with reverse convex constraints

DOI10.1016/J.NA.2012.11.025zbMath1287.90051OpenAlexW2012149142MaRDI QIDQ1937571

Yusuke Saeki, Daishi Kuroiwa

Publication date: 1 March 2013

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2012.11.025

zbMATH Keywords

optimality conditionsconvex programmingfractional programmingDC programmingreverse convex constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (5)

Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces ⋮ Duality theorems for quasiconvex programming with a reverse quasiconvex constraint ⋮ Split proximal linearized algorithm and convergence theorems for the split DC program ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions ⋮ A forward-backward algorithm for the DC programming in Hilbert spaces

This page was built for publication: Optimality conditions for DC programming problems with reverse convex constraints