๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A relaxation method for nonconvex quadratically constrained quadratic programs

โœ Scribed by Faiz A. Al-Khayyal; Christian Larsen; Timothy Van Voorhis

Publisher
Springer US
Year
1995
Tongue
English
Weight
806 KB
Volume
6
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The bounds of feasible space on constrai
The bounds of feasible space on constrained nonconvex quadratic programming
โœ Jinghao Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 135 KB

This paper presents a method to estimate the bounds of the radius of the feasible space for a class of constrained nonconvex quadratic programmings. Results show that one may compute a bound of the radius of the feasible space by a linear programming which is known to be a P -problem [N. Karmarkar,

Splitting methods for constrained quadra
Splitting methods for constrained quadratic programs in data analysis
โœ E. Galligani; V. Ruggiero; L. Zanni ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 440 KB

This paper is concerned with the numerical solution of a linearly constrained quadratic programming problem by methods that use a splitting of the objective matrix. We present an acceleration step for a general splitting algorithm and we establish the convergence of the resulting accelerated scheme.