Convex-concave programming as a decomposition approach to global optimization
From MaRDI portal
Publication:1373016
zbMATH Open0883.90110MaRDI QIDQ1373016FDOQ1373016
Authors: Le Dung Muu 
Publication date: 15 December 1997
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
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
decompositionbranch-and-boundcutting planed.c. programmingadaptive subdivisionconvex-concave programs
Cited In (10)
- 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
- Decomposition-aggregation method for convex programming problems
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Convex Programming Methods for Global Optimization
- A general framework for convexity analysis in deterministic global optimization
- Global optimization from concave minimization to concave mixed variational inequality
- Constraint decomposition algorithms in global optimization
- A decomposition approach for global optimum search in QP, NLP and MINLP problems
- Title not available (Why is that?)
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)
