full
search.png

Search

close.png

Cancel

arrow
Volume 17, Issue 3
Subspace Search Method for Quadratic Programming with Box Constraints

Zi-Luan Wei

J. Comp. Math., 17 (1999), pp. 307-314.

Published online: 1999-06

Preview Full PDF 2474 25171

Cited by

google scholar semantic scholar
Export citation
  • Abstract

A subspace search method for solving quadratic programming with box constraints is presented in this paper. The original problem is divided into many independent subproblem at an initial point, and a search direction is obtained by solving each of the subproblem, as well as a new iterative point is determined such that the value of objective function is decreasing. The convergence of the algorithm is proved under certain assumptions, and the numerical results are also given.  

  • Keywords

Subspace search method, Quadratic programing, Matrix splitting.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-17-307, author = {Wei , Zi-Luan}, title = {Subspace Search Method for Quadratic Programming with Box Constraints}, journal = {Journal of Computational Mathematics}, year = {1999}, volume = {17}, number = {3}, pages = {307--314}, abstract = {

A subspace search method for solving quadratic programming with box constraints is presented in this paper. The original problem is divided into many independent subproblem at an initial point, and a search direction is obtained by solving each of the subproblem, as well as a new iterative point is determined such that the value of objective function is decreasing. The convergence of the algorithm is proved under certain assumptions, and the numerical results are also given.  

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9104.html} }
TY - JOUR T1 - Subspace Search Method for Quadratic Programming with Box Constraints AU - Wei , Zi-Luan JO - Journal of Computational Mathematics VL - 3 SP - 307 EP - 314 PY - 1999 DA - 1999/06 SN - 17 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9104.html KW - Subspace search method, Quadratic programing, Matrix splitting. AB -

A subspace search method for solving quadratic programming with box constraints is presented in this paper. The original problem is divided into many independent subproblem at an initial point, and a search direction is obtained by solving each of the subproblem, as well as a new iterative point is determined such that the value of objective function is decreasing. The convergence of the algorithm is proved under certain assumptions, and the numerical results are also given.  

Wei , Zi-Luan. (1999). Subspace Search Method for Quadratic Programming with Box Constraints. Journal of Computational Mathematics. 17 (3). 307-314. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard