SIAM Journal on Imaging Sciences· 2013Q1
A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- 1,207citations
- Q1SCImago
- 2013year
Short summary
A new generalized block coordinate descent method achieves superior speed and solution quality for regularized multiconvex optimization problems, including nonnegative tensor factorization and completion.
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: Computational Mechanics
Computational MechanicsEngineering