@Article{JCM-20-643,
author = {Wei , Zi-Luan},
title = {Regular Splitting and Potential Reduction Method for Solving Quadratic Programming Problem with Box Constraints},
journal = {Journal of Computational Mathematics},
year = {2002},
volume = {20},
number = {6},
pages = {643--652},
abstract = {<p style="text-align: justify;">A regular splitting and potential reduction method is presented for solving a quadratic programming problem with box constraints (QPB) in this paper. A general algorithm is designed to solve the QPB problem and generate a sequence of iterative points. We show that the number of iterations to generate an&nbsp;<span style="text-align: justify;">$\epsilon$-minimum solution or</span> an $\epsilon$-KKT solution by the algorithm is bounded by $O(\frac{n^2}{\epsilon}\log{\frac{1}{\epsilon}}+n\log{(1+\sqrt{2n})})$, and the total running time is bounded by $O(n^2(n+\log n+\log \frac{1}{\epsilon})(\frac{n}{\epsilon}\log{\frac{1}{\epsilon}}+\log n))$ arithmetic operations.</p>},
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/8949.html}
}