Regularization Methods for SDP Relaxations in Large Scale Polynomial Optimization

Details Regularization Methods for SDP Relaxations in Large Scale Polynomial Optimization Regularization Methods for SDP Relaxations in Large Scale Polynomial Optimization

2009-09-19

arxiv.org/abs/0909.3551v2

Mathematics

Optimization and Control

24 pages

Scientific paper

We study how to solve semidefinite programming relaxations for large scale polynomial optimization. When interior-point methods are used, typically only small or moderately large problems could be solved. This paper studies regularization methods for solving polynomial optimization problems. We describe these methods for semidefinite optimization with block structures, and then apply them to solve large scale polynomial optimization problems. The performance is tested on various numerical examples. By regularization methods, significantly bigger problems could be solved on a regular computer, which is almost impossible by interior point methods.

Affiliated with

Also associated with

No associations

Rating

Regularization Methods for SDP Relaxations in Large Scale Polynomial Optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Regularization Methods for SDP Relaxations in Large Scale Polynomial Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regularization Methods for SDP Relaxations in Large Scale Polynomial Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-485671