✦ LIBER ✦

A Simplicial Branch-and-Bound Method for Solving Nonconvex All-Quadratic Programs

✍ Scribed by Ulrich Raber

Book ID: 110263235
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 107 KB
Volume: 13
Category: Article
ISSN: 0925-5001
DOI: 10.1023/a:1008377529330

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposition Methods for Solving Noncon

Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound*

✍ Riccardo Cambini; Claudio Sodini 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 207 KB

A simplicial branch-and-bound algorithm

A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs

✍ Jeff Linderoth 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 390 KB

A Combined D.C. Optimization—Ellipsoidal

A Combined D.C. Optimization—Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems

✍ Le Thi Hoai An; Pham Dinh Tao; Le Dung Muu 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 145 KB

A branch and cut algorithm for nonconvex

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

✍ Charles Audet; Pierre Hansen; Brigitte Jaumard; Gilles Savard 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 221 KB

We present a branch and cut algorithm that yields in finite time, a globally ☼-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. The idea is to estimate all quadratic terms by successive linearizations within a bra

A finite branch-and-bound algorithm for

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

✍ Samuel Burer; Dieter Vandenbussche 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 347 KB

A branch and bound algorithm for globall

A branch and bound algorithm for globally solving a class of nonconvex programming problems

✍ Hongwei Jiao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 574 KB