SIAM Journal on Optimization· 2012Q1
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- 1,250citations
- Q1SCImago
- 2012year
Short summary
New coordinate descent methods using random partial updates significantly improve efficiency for huge-scale optimization problems, outperforming standard deterministic algorithms in certain cases.
AI-generated from the title and abstract; the full text is not read.
TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app
The rest is in the Pofolia app
Takeaways, key points and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Numerical Analysis
Numerical AnalysisMathematics