Author of the publication

Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces.

, , , , and . Numer. Algorithms, 73 (1): 33-76 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle., , , , and . J. Approx. Theory, (2014)The circumcentered-reflection method achieves better rates than alternating projections., , , , and . Comput. Optim. Appl., 79 (2): 507-530 (2021)Level bundle-like algorithms for convex optimization., and . J. Glob. Optim., 59 (4): 787-809 (2014)Full convergence of an approximate projection method for nonsmooth variational inequalities., and . Math. Comput. Simul., (2015)A Steepest Descent-Like Method for Variable Order Vector Optimization Problems., and . J. Optimization Theory and Applications, 162 (2): 371-391 (2014)A Direct Splitting Method for Nonsmooth Variational Inequalities., and . J. Optimization Theory and Applications, 161 (3): 728-737 (2014)A Subgradient-Like Algorithm for Solving Vector Convex Inequalities., and . J. Optimization Theory and Applications, 162 (2): 392-404 (2014)Subgradient algorithms for solving variable inequalities., , and . Appl. Math. Comput., (2014)Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces., , , , and . Numer. Algorithms, 73 (1): 33-76 (2016)A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming., , , and . J. Comput. Appl. Math., (2016)