On the convergence of the coordinate descent method for convex differentiable minimization

Journal of Optimization Theory and Applications

Volumn 72, Issue 1, 1992, Pages 7-35

  Luo, Z Q ^a   Tseng, P ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

convex differentiable optimization; Coordinate descent; symmetric linear complementarity problems

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

CONVEX DIFFERENTIABLE MINIMIZATION; COORDINATE DESCENT METHOD;

OPTIMIZATION;

EID: 0026678659     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/BF00939948     Document Type: Article

References (56)

1. Sparsity-Preserving SOR Algorithms for Separable Quadratic and Linear Programming
2. Parallel Gradient Projection Successive Overrelaxation for Symmetric Linear Complementarity Problems and Linear Programs
3. A Family of Iterative Quadratic Optimization Algorithms for Pairs of Inequalities, with Application in Diagnostic Radiology
4. A Special Class of Large Quadratic Programs
5. On the Solution of Large, Structured Linear Complementarity Problems: The Block-Partitioned Case
6. An Algorithm for Computing the Capacity of Arbitrary DMCs
7. Computation of Channel Capacity and Rate Distortion Functions
8. Calculation of Telephone Traffic
9. Bregman's Balancing Method
10. Parallel Application of Block-Iterative Methods in Medical Imaging and Radiation Therapy
11. A Convergent Algorithm for Maximum Entropy Image Restoration with a Medical X-Ray Application
12. An Algorithm for Maximizing Entropy Subject to Simple Bounds
13. Image Enhancement and Restoration
14. On the Rationale of Maximum Entropy Methods
15. Which Is the Better Entropy Expression for Speech Processing—S log S or log S?
16. Generalized Iterative Scaling for Log-Linear Models
17. Resolution of Mathematical Programming with Nonlinear Constraints by the Method of Centers
18. A New Polynomial-Time Algorithm for Linear Programming
19. New Algorithms in Convex Programming Based on a Notion of Center for Systems of Analytic Inequalities and on Rational Extrapolation
20. A Quadratic Programming Procedure
21. On the Convergence of a Block Successive Overrelaxation Method for a Class of Linear Complementarity Problems
22. The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
23. On the RAS Algorithm
24. Proof of the Convergence of Sheleikhovskii's Method for a Problem with Transportation Constraints
25. A Comparative Study of Algorithms for Matrix Balancing
26. Vector and Parallel Computing for Matrix Balancing
27. Optimization of log x Entropy over Linear Equality Constraints
28. A Convex Programming Procedure
29. On Search Directions for Minimization Algorithms
30. On the Convergence of Sequential Minimization Algorithms
31. Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
32. Descent Methods for Convex Essentially Smooth Optimization
33. Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
34. The Relaxation Method of Finding the Common Point Convex Sets and Its Application to the Solution of Problems in Convex Programming
35. Relaxation Methods for Newtork flow Problems with Convex Arc Costs
36. On the Convergence of a Matrix-Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
37. Relaxation Methods for Problems with Strictly Convex Separable Costs and Linear Constraints
38. On Approximate Solutions of Systems of Linear Inequalities
39. Bounds for Errors in the Solution Set of a Perturbed Linear Program
40. Lipschitz Continuity of Solutions of Linear Inequalities: Programs and Complementarity Problems
41. Iterative Methods for Large Convex Quadratic Programs: A Survey
42. On the Convergence Properties of Hildreth's Quadratic Programming Algorithm
43. A Relaxed Version of Bregman's Method for Convex Programming
44. An Iterative Row-Action Method for Interval Convex Programming