A block symmetric Gauss–Seidel decomposition theorem for convex composite quadratic programming and its applications
- 23 February 2018
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 175 (1-2) , 395-418
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Ministry of Education - Singapore (R-146-000-194-112, R-146-000-194-112)
This publication has 35 references indexed in Scilit:
- On the Convergence of Block Coordinate Descent Type MethodsSIAM Journal on Optimization, 2013
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite functionMathematical Programming, 2012
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDPSIAM Journal on Optimization, 2012
- Approximation accuracy, gradient methods, and error bound for structured convex optimizationMathematical Programming, 2010
- On the convergence of the block nonlinear Gauss–Seidel method under convex constraintsOperations Research Letters, 2000
- Error bounds and convergence analysis of feasible descent methods: a general approachAnnals of Operations Research, 1993
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth MinimizationSIAM Journal on Control and Optimization, 1992
- The hierarchical basis multigrid methodNumerische Mathematik, 1988
- Some continuity properties of polyhedral multifunctions1981
- On the accelerated SSOR method for solving large linear systemsAdvances in Mathematics, 1977