A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
From MaRDI portal
Publication:2479840
DOI10.1007/s10589-007-9068-2zbMath1147.90388OpenAlexW2029924310MaRDI QIDQ2479840
Hidetoshi Nagai, Takahito Kuno
Publication date: 3 April 2008
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://tsukuba.repo.nii.ac.jp/record/20540/files/CS-TR-05-2.pdf
Lagrangian relaxationGlobal optimizationConcave minimizationBranch-and-bound algorithmLow-rank nonconvexity
Related Items (2)
A new Lagrangian-Benders approach for a concave cost supply chain network design problem ⋮ A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Linear multiplicative programming
- Strongly polynomial time algorithms for certain concave minimization problems on networks
- Optimization on low rank nonconvex structures
- Global optimization of multiplicative programs
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- An algorithm for nonconvex programming problems
- An Algorithm for Separable Nonconvex Programming Problems
- Convex Analysis
- A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST
- Convex analysis and global optimization
- Introduction to global optimization.
- A Lagrangian based branch-and-bound algorithm for production-transportation problems
- A finite branch-and-bound algorithm for linear multiplicative programming
This page was built for publication: A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
