On the exhaustivity of simplicial partitioning
From MaRDI portal
Publication:2442641
DOI10.1007/s10898-013-0040-7zbMath1292.65064MaRDI QIDQ2442641
Publication date: 1 April 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0040-7
Related Items
On refinement of the unit simplex using regular simplices, Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound, LP-based tractable subcones of the semidefinite plus nonnegative cone, A modified simplex partition algorithm to test copositivity, Globally maximizing the sum of squares of quadratic forms over the unit sphere, A new certificate for copositivity
Uses Software
Cites Work
- Unnamed Item
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Normal conical algorithm for concave minimization over polytopes
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Global optimization based on a statistical model and simplicial partitioning.
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Algorithmic copositivity detection by simplicial partition
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- On generalized bisection of 𝑛-simplices
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Some NP-complete problems in quadratic and nonlinear programming
- An algorithm for nonconvex programming problems
- A Proof of Convergence and an Error Bound for the Method of Bisection in R n
- Introduction to global optimization.
