On the complexity of a combined homotopy interior method for convex programming (Q859861)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5117666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of a combined homotopy interior method for convex programming |
scientific article; zbMATH DE number 5117666 |
Statements
On the complexity of a combined homotopy interior method for convex programming (English)
0 references
22 January 2007
0 references
The authors consider convex nonlinear optimization problems of the form \[ \text{minimize }f(x),\quad g_i(x)\leq 0,\quad x\in\mathbb{R}^n. \] For this problems, polynomiality of a combined homotopy interior-point method for convex programming is discussed. By taking a piecewise technique, upper bounds for the total numbers of iterations are obtained. No numerical tests are given.
0 references
polynomiality
0 references
homotopy method
0 references
interior-point method
0 references
path-following
0 references
convex nonlinear optimization
0 references
0 references
0 references
0.8515651226043701
0 references
0.8515651226043701
0 references
0.8450331687927246
0 references
0.8350654244422913
0 references
0.8125221133232117
0 references
