Note—A Note on the Cyclic Coordinate Ascent Method

DOI10.1287/MNSC.16.9.642zbMATH Open0194.20403OpenAlexW1984281714MaRDI QIDQ5589752FDOQ5589752

Norman Zadeh

Publication date: 1970

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.16.9.642

zbMATH Keywords

operations research

Cited In (6)

• A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Control analysis and design via randomised coordinate polynomial minimisation
• Relaxation methods for problems with strictly convex separable costs and linear constraints
• A survey on the continuous nonlinear resource allocation problem
• Globally convergent block-coordinate techniques for unconstrained 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)