Optimality conditions for DC programming problems with reverse convex constraints

DOI10.1016/J.NA.2012.11.025MaRDI QIDQ1937571zbMATH OpenOpenAlexFDO

Authors 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

convex programmingoptimality conditionsfractional programmingDC programmingreverse convex constraints

Mathematics Subject Classification ID

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

Recommendations

• Optimality conditions for D.C. vector optimization problems under reverse convex constraints
• Optimality conditions for a DC fractional programming problem
• A necessary and sufficient constraint qualification for DC programming problems with convex inequality constraints
• Reverse convex problems: an approach based on optimality conditions
• Necessary and sufficient optimality conditions in DC semi-infinite programming

Cited in

(18)

• Approximate optimality conditions and stopping criteria in canonical DC programming
• scientific article; zbMATH DE number 7448122 (Why is no real title available?)
• Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
• Necessary and sufficient optimality conditions in DC semi-infinite programming
• Reverse convex programs: stability and global optimality
• Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces
• Beyond canonical dc-optimization: the single reverse polar problem
• A necessary and sufficient constraint qualification for DC programming problems with convex inequality constraints
• New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
• A forward-backward algorithm for the DC programming in Hilbert spaces
• Split proximal linearized algorithm and convergence theorems for the split DC program
• An optimal bound for d. c. programs with convex constraints
• A difference of convex and polyhedral convex functions programming problem
• Optimality conditions for D.C. vector optimization problems under reverse convex constraints
• Reverse convex problems: an approach based on optimality conditions
• Optimality conditions for a DC fractional programming problem
• Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality
• scientific article; zbMATH DE number 6005913 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937571)