Fast algorithm for singly linearly constrained quadratic programs with box-like constraints.

Saved in:

Bibliographic Details
Title:	Fast algorithm for singly linearly constrained quadratic programs with box-like constraints.
Authors:	Liu, Meijiao¹ liulmj@gmail.com, Liu, Yong-Jin¹ yjliu@sau.edu.cn
Source:	Computational Optimization & Applications. Mar2017, Vol. 66 Issue 2, p309-326. 18p.
Subjects:	Quadratic programming, Secant function, Algorithms, Mathematical variables, Linear equations
Abstract:	This paper focuses on a singly linearly constrained class of convex quadratic programs with box-like constraints. We propose a new fast algorithm based on parametric approach and secant approximation method to solve this class of quadratic problems. We design efficient implementations for our proposed algorithm and compare its performance with two state-of-the-art standard solvers called Gurobi and Mosek. Numerical results on a variety of test problems demonstrate that our algorithm is able to efficiently solve the large-scale problems with the dimension up to fifty million and it substantially outperforms Gurobi and Mosek in terms of the running time. [ABSTRACT FROM AUTHOR]
	Copyright of Computational Optimization & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	This paper focuses on a singly linearly constrained class of convex quadratic programs with box-like constraints. We propose a new fast algorithm based on parametric approach and secant approximation method to solve this class of quadratic problems. We design efficient implementations for our proposed algorithm and compare its performance with two state-of-the-art standard solvers called Gurobi and Mosek. Numerical results on a variety of test problems demonstrate that our algorithm is able to efficiently solve the large-scale problems with the dimension up to fifty million and it substantially outperforms Gurobi and Mosek in terms of the running time. [ABSTRACT FROM AUTHOR]
ISSN:	09266003
DOI:	10.1007/s10589-016-9863-8