Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 21:38, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions |
scientific article |
Statements
Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (English)
0 references
23 July 2007
0 references
The interior-point algorithms working in wider neighborhoods are generally known to perform better than those counterparts using smaller neighborhoods. The author considers predictor-corrector methods based on a 2-norm and an \({\infty}\)-norm neighborhood, and shows how to use the least value of a proximity measure function to enlarge the neighborhood of the central path. The algorithms are proved to retain both the best known iteration complexity and the quadratic convergence of the original algorithms. The methods can be viewed as a new design for interior-point methods.
0 references
linear programming
0 references
interior-point algorithms
0 references
iteration complexity
0 references
neighborhoods
0 references
predictor-corrector methods
0 references
quadratic convergence
0 references