A polynomial path following algorithm for convex programming (Q2479155)
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 5253842
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial path following algorithm for convex programming |
scientific article; zbMATH DE number 5253842 |
Statements
A polynomial path following algorithm for convex programming (English)
0 references
26 March 2008
0 references
The authors propose an interior point algorithm for convex nonlinear programming by utilizing the \({\beta}\)-cone neighborhood technique with a path following algorithm and the smoothing Newton method to trace the combined interior homotopy pathway. The global convergence of the algorithm is proved and the polynomial-time complexity of the algorithm is established. Some numerical experimental results are presented.
0 references
convex nonlinear programming
0 references
combined homotopy
0 references
path following algorithm
0 references
global convergence
0 references
polynomial time algorithm
0 references
interior point algorithm
0 references
smoothing Newton method
0 references
numerical experimental
0 references
0 references
0.8485329151153564
0 references
0.8452984690666199
0 references
0.843315064907074
0 references
0.8294090032577515
0 references
0.8263699412345886
0 references
