Partly convex and convex-monotonic optimization problems

MaRDI QIDQ4666754zbMATH OpenFDO

Authors Hoang Tuy

Publication date 5 April 2005

zbMATH Keywords

branch-and-bound methodconsistent bounddual boundhybrid convex-monotonic optimizationLagrangian relaxationnonconvex optimizationpartly convex programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Convexification and monotone optimization
• Convex optimization and monotonic variational inequalities
• Convexification and concavification for a class of non-monotone optimization problems
• scientific article; zbMATH DE number 1833163
• scientific article; zbMATH DE number 970337
• A class of convexification and concavification methods for non-monotone optimization problems
• Convexification, concavification and monotonization in global optimization
• Monotone operator theory in convex optimization
• scientific article; zbMATH DE number 3845356
• Properties and applications of programs with monotone and convex constraints

Cited in

(3)

• The convergence of partitioning dual bounds for partial convex optimization problems
• Alternative branching rules for some nonconvex problems
• Piecewise-convex maximization problems.

This page was built for publication: Partly convex and convex-monotonic optimization problems

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