SIAM Journal on Optimization· 2012Q1
Maximum Block Improvement and Polynomial Optimization
- 184citations
- Q1SCImago
- 2012year
Short summary
A new Maximum Block Improvement (MBI) method efficiently solves spherically constrained homogeneous polynomial optimization problems by accepting only block updates that yield the greatest improvement, proven to converge to stationary points.
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 Mathematics
Computational MathematicsMathematics