A difference of convex and polyhedral convex functions programming problem

MaRDI QIDQ5117520zbMATH OpenFDO

Authors Satoshi Suzuki, Daishi Kuroiwa, Yusuke Saeki

Publication date 25 August 2020

zbMATH Keywords

fractional programmingbasic constraint qualificationdifference of convex and polyhedral convex functions programming

Mathematics Subject Classification ID

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

Recommendations

• A necessary and sufficient constraint qualification for DC programming problems with convex inequality constraints
• Optimality conditions in DC-constrained mathematical programming problems
• Optimality conditions for DC programming problems with reverse convex constraints
• Qualification and optimality conditions for dc programs with infinite constraints
• DC programming: overview.

Cited in

(6)

• Necessary conditions for local optimality in difference-of-convex programming
• A necessary and sufficient constraint qualification for DC programming problems with convex inequality constraints
• Optimality conditions in DC-constrained mathematical programming problems
• Local programming.
• The DTC (difference of tangentially convex functions) programming: optimality conditions
• DP optimization: optimality conditions and numerical methods

This page was built for publication: A difference of convex and polyhedral convex functions programming problem

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