Convex-concave programming as a decomposition approach to global optimization

MaRDI QIDQ1373016zbMATH OpenFDO

Authors Le Dung Muu

Publication date 15 December 1997

Published in Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

adaptive subdivisionbranch-and-boundconvex-concave programscutting planed.c. programmingdecomposition

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Convex Programming Methods for Global Optimization
• An algorithm for solving convex programs with an additional convex- concave constraint
• Constraint decomposition algorithms in global optimization
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization

Cited in

(12)

• Constraint decomposition algorithms in global optimization
• A general framework for convexity analysis in deterministic global optimization
• A decomposition approach for global optimum search in QP, NLP and MINLP problems
• Decomposition-aggregation method for convex programming problems
• scientific article; zbMATH DE number 6027005 (Why is no real title available?)
• Convex Programming Methods for Global Optimization
• Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
• An algorithm for solving convex programs with an additional convex- concave constraint
• Branch-and-bound algorithms for solving a modified consumer problem
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
• Monotonic complementarity problems
• Global optimization from concave minimization to concave mixed variational inequality

This page was built for publication: Convex-concave programming as a decomposition approach to global optimization

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