Augmented self-concordant barriers and nonlinear optimization problems with finite complexity (Q1424292)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Augmented self-concordant barriers and nonlinear optimization problems with finite complexity |
scientific article; zbMATH DE number 2055186
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Augmented self-concordant barriers and nonlinear optimization problems with finite complexity |
scientific article; zbMATH DE number 2055186 |
Statements
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity (English)
0 references
11 March 2004
0 references
Augmented self-concordant barrier functions for convex cones, which are the sum of self-concordant barrier for the cone and a positive-semidifinite quadratic form, are studied. The complexity of finding the analytic center of these barrier functions is studied. It is shown that the complexity of a path-following method of barrier functions is independent of the particular data set for some special classes of quadratic forms and some convex cones. These problems form a class with finite polynomial complexity.
0 references
nonlinear optimization
0 references
barrier function
0 references
central path
0 references
finite polynomial complexity
0 references
