Note—A Note on the Cyclic Coordinate Ascent Method
From MaRDI portal
Publication:5589752
Cited in
(6)- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- A survey on the continuous nonlinear resource allocation problem
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Globally convergent block-coordinate techniques for unconstrained optimization
- Control analysis and design via randomised coordinate polynomial minimisation
- A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization
This page was built for publication: Note—A Note on the Cyclic Coordinate Ascent Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5589752)