· 2013
Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization
- 898citations
- 2013year
Short summary
A new variant of the Frank-Wolfe algorithm achieves sparse solutions in convex optimization problems without requiring computationally expensive projections.
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