English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We study how to solve semidefinite programming relaxations for large scalepolynomial optimization. When interior-point methods are used, typically onlysmall or moderately large problems could be solved. This paper studiesregularization methods for solving polynomial optimization problems. Wedescribe these methods for semidefinite optimization with block structures, andthen apply them to solve large scale polynomial optimization problems. Theperformance is tested on various numerical examples. By regularization methods,significantly bigger problems could be solved on a regular computer, which isalmost impossible by interior point methods.

Regularization Methods for SDP Relaxations in Large Scale Polynomial Optimization