An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints

An interior-point trust-region algorithm is proposed for minimization of a convex quadratic objective function over a general convex set. The algorithm uses a trust-region model to ensure descent on a suitable merit function. The complexity of our algorithm is proved to be as good as the interior-po...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Optimization methods & software Ročník 23; číslo 2; s. 251 - 258
Hlavní autoři:	Lu, Ye, Yuan, Ya-Xiang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Taylor & Francis 01.04.2008
Témata:	interior-point algorithm self-concordant barrier trust-region subproblem
ISSN:	1055-6788, 1029-4937
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	An interior-point trust-region algorithm is proposed for minimization of a convex quadratic objective function over a general convex set. The algorithm uses a trust-region model to ensure descent on a suitable merit function. The complexity of our algorithm is proved to be as good as the interior-point polynomial algorithm.
ISSN:	1055-6788 1029-4937
DOI:	10.1080/10556780701645057