Projection methods in conic optimization

Details Projection methods in conic optimization Projection methods in conic optimization

2011-03-08

arxiv.org/abs/1103.1511v1

Mathematics

Optimization and Control

Scientific paper

There exist efficient algorithms to project a point onto the intersection of a convex cone and an affine subspace. Those conic projections are in turn the work-horse of a range of algorithms in conic optimization, having a variety of applications in science, finance and engineering. This chapter reviews some of these algorithms, emphasizing the so-called regularization algorithms for linear conic optimization, and applications in polynomial optimization. This is a presentation of the material of several recent research articles; we aim here at clarifying the ideas, presenting them in a general framework, and pointing out important techniques.

Affiliated with

Also associated with

No associations

Rating

Projection methods in conic 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 Projection methods in conic optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Projection methods in conic optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-82529