On the convergence of the block nonlinear Gauss–Seidel method under convex constraints
Top Cited Papers
- 1 April 2000
- journal article
- research article
- Published by Elsevier BV in Operations Research Letters
- Vol. 26 (3), 127-136
- https://doi.org/10.1016/s0167-6377(99)00074-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Globally convergent block-coordinate techniques for unconstrained optimizationOptimization Methods and Software, 1999
- Decomposition Methods for Differentiable Optimization Problems over Cartesian Product SetsComputational Optimization and Applications, 1998
- Partial Proximal Minimization Algorithms for Convex PprogrammingSIAM Journal on Optimization, 1994
- Asymptotic properties of the fenchel dual functional and applications to decomposition problemsJournal of Optimization Theory and Applications, 1992
- On the convergence of the coordinate descent method for convex differentiable minimizationJournal of Optimization Theory and Applications, 1992
- Decomposition algorithm for convex differentiable minimizationJournal of Optimization Theory and Applications, 1991
- Maximization of A convex quadratic function under linear constraintsMathematical Programming, 1976
- A cutting plane algorithm for solving bilinear programsMathematical Programming, 1976
- On search directions for minimization algorithmsMathematical Programming, 1973
- Note—A Note on the Cyclic Coordinate Ascent MethodManagement Science, 1970