Projection methods in convex optimization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00186933" target="_blank" >RIV/68407700:21230/12:00186933 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Projection methods in convex optimization
Original language description
There exist efficient algorithms to project a point onto the intersection of a convex conic 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.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP103%2F10%2F0628" target="_blank" >GAP103/10/0628: Semidefinite programming for nonlinear dynamical systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Book/collection name
Handbook on Semidefinite, Conic and Polynomial Optimization
ISBN
978-1-4614-0768-3
Number of pages of the result
36
Pages from-to
565-600
Number of pages of the book
957
Publisher name
Springer-Verlag
Place of publication
Berlin
UT code for WoS chapter
—