Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints-Reference-Cited by-同舟云学术

Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints

Published:2009-02-19 Issue:1 Volume:48 Page:23-44
ISSN:0926-6003
Container-title:Computational Optimization and Applications
language:en
Short-container-title:Comput Optim Appl

Author:

Dostál Zdeněk,Domorádová Marta,Sadowská Marie

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/s10589-009-9237-6.pdf

Reference44 articles.

1. Axelsson, O.: Iterative Solution Methods. Cambridge University Press, Cambridge (1994)

2. Bazaraa, M.S., Shetty, C.M.: Nonlinear Programming. Wiley, New York (1979)

3. Bertsekas, D.P.: Nonlinear Optimization. Athena Scientific, Belmont (1999)

4. Bielschowski, R.H., Friedlander, A., Gomes, F.A.M., Martínez, J.M., Raydan, M.: An adaptive algorithm for bound constrained quadratic minimization. Investig. Oper. 7, 67–102 (1997)

5. Bouchala, J., Dostál, Z., Sadowská, M.: Theoretically supported scalable BETI method for variational inequalities. Computing 82, 53–75 (2008)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. MPRGP for Bound Constrained QP;Scalable Algorithms for Contact Problems;2023

2. A dual‐primal finite element tearing and interconnecting method for nonlinear variational inequalities utilizing linear local problems;International Journal for Numerical Methods in Engineering;2021-08-12

3. Proportionality-Based Gradient Methods with Applications in Contact Mechanics;Lecture Notes in Computer Science;2018

4. MPRGP for Bound-Constrained QP;Scalable Algorithms for Contact Problems;2016

5. On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature;Applied Mathematics and Computation;2014-11