✦ LIBER ✦

Globally solving nonconvex quadratic programming problems via completely positive programming

✍ Scribed by Jieqiu Chen; Samuel Burer

Book ID: 107661792
Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 367 KB
Volume: 4
Category: Article
ISSN: 1867-2949
DOI: 10.1007/s12532-011-0033-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new accelerating method for globally s

A new accelerating method for globally solving a class of nonconvex programming problems

✍ Peiping Shen; Xiaodi Bai; Weimin Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 591 KB

In this paper, we combine the new global optimization method proposed by Jiao [H. Jiao, A branch and bound algorithm for globally solving a class of nonconvex programming problems, Nonlinear Anal. 70 (2) (2008) 1113-1123] with a suitable deleting technique to propose a new accelerating global optimi

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

Global optimization of a class of noncon

Global optimization of a class of nonconvex quadratically constrained quadratic programming problems

✍ Yong Xia 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 194 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

Solving nonconvex nonlinear programming

Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method

✍ Menglong Su; Bo Yu; Jian Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Solving Standard Quadratic Optimization

Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming

✍ Immanuel M. Bomze; Etienne De Klerk 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 193 KB