Search: onr:"swepub:oai:DiVA.org:liu-90310" >
Polynomial Complexi...
-
Hansson, AndersLinköpings universitet,Reglerteknik,Tekniska högskolan
(author)
Polynomial Complexity for a Nesterov-Todd Potential-Reduction Method with Inexact Search Directions
- Article/chapterEnglish2003
Publisher, publication year, extent ...
Numbers
-
LIBRIS-ID:oai:DiVA.org:liu-90310
-
https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-90310URI
-
https://doi.org/10.1109/CDC.2003.1271745DOI
Supplementary language notes
-
Language:English
-
Summary in:English
Part of subdatabase
Classification
-
Subject category:ref swepub-contenttype
-
Subject category:kon swepub-publicationtype
Notes
-
In this paper is discussed how to efficiently solve semidefinite programs related to the Kalman-Yakubovich-Popov lemma. We consider a potential-reduction method where Nesterov-Todd search directions are computed inexactly by applying a preconditioned conjugate gradient method to the Schur complement equation. An efficient preconditioner based on Lyapunov equations is derived. We give a proof of polynomial convergence for this interior point method.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
-
Gillberg, JonasLinköpings universitet,Reglerteknik,Tekniska högskolan(Swepub:liu)jongi06
(author)
-
Linköpings universitetReglerteknik
(creator_code:org_t)
Related titles
-
In:Proceedings of the 42nd IEEE Conference on Decision and Control, s. 3824-3829 vol.40780379241
Internet link
Find in a library
To the university's database