A polynomial method of approximate centers for linear programming
| ISSN: |
1436-4646
|
|---|---|
| Keywords: |
Interior-point method ; linear programming ; Karmarkar's method ; polynomial-time algorithm ; logarithmic barrier function ; path-following method
|
| Source: |
Springer Online Journal Archives 1860-2000
|
| Topics: |
Computer Science
Mathematics
|
| Notes: |
Abstract We present a path-following algorithm for the linear programming problem with a surprisingly simple and elegant proof of its polynomial behaviour. This is done both for the problem in standard form and for its dual problem. We also discuss some implementation strategies.
|
| Type of Medium: |
Electronic Resource
|
| URL: |
| _version_ | 1798296240032579584 |
|---|---|
| autor | Roos, C. Vial, J. -Ph. |
| autorsonst | Roos, C. Vial, J. -Ph. |
| book_url | http://dx.doi.org/10.1007/BF01586056 |
| datenlieferant | nat_lic_papers |
| hauptsatz | hsatz_simple |
| identnr | NLM206327358 |
| iqvoc_descriptor_keyword | iqvoc_00000483:programming |
| iqvoc_descriptor_title | iqvoc_00000483:programming |
| issn | 1436-4646 |
| journal_name | Mathematical programming |
| materialart | 1 |
| notes | Abstract We present a path-following algorithm for the linear programming problem with a surprisingly simple and elegant proof of its polynomial behaviour. This is done both for the problem in standard form and for its dual problem. We also discuss some implementation strategies. |
| package_name | Springer |
| publikationsjahr_anzeige | 1992 |
| publikationsjahr_facette | 1992 |
| publikationsjahr_intervall | 8009:1990-1994 |
| publikationsjahr_sort | 1992 |
| publisher | Springer |
| reference | 54 (1992), S. 295-305 |
| schlagwort | Interior-point method linear programming Karmarkar's method polynomial-time algorithm logarithmic barrier function path-following method |
| search_space | articles |
| shingle_author_1 | Roos, C. Vial, J. -Ph. |
| shingle_author_2 | Roos, C. Vial, J. -Ph. |
| shingle_author_3 | Roos, C. Vial, J. -Ph. |
| shingle_author_4 | Roos, C. Vial, J. -Ph. |
| shingle_catch_all_1 | Roos, C. Vial, J. -Ph. A polynomial method of approximate centers for linear programming Interior-point method linear programming Karmarkar's method polynomial-time algorithm logarithmic barrier function path-following method Interior-point method linear programming Karmarkar's method polynomial-time algorithm logarithmic barrier function path-following method Abstract We present a path-following algorithm for the linear programming problem with a surprisingly simple and elegant proof of its polynomial behaviour. This is done both for the problem in standard form and for its dual problem. We also discuss some implementation strategies. 1436-4646 14364646 Springer |
| shingle_catch_all_2 | Roos, C. Vial, J. -Ph. A polynomial method of approximate centers for linear programming Interior-point method linear programming Karmarkar's method polynomial-time algorithm logarithmic barrier function path-following method Interior-point method linear programming Karmarkar's method polynomial-time algorithm logarithmic barrier function path-following method Abstract We present a path-following algorithm for the linear programming problem with a surprisingly simple and elegant proof of its polynomial behaviour. This is done both for the problem in standard form and for its dual problem. We also discuss some implementation strategies. 1436-4646 14364646 Springer |
| shingle_catch_all_3 | Roos, C. Vial, J. -Ph. A polynomial method of approximate centers for linear programming Interior-point method linear programming Karmarkar's method polynomial-time algorithm logarithmic barrier function path-following method Interior-point method linear programming Karmarkar's method polynomial-time algorithm logarithmic barrier function path-following method Abstract We present a path-following algorithm for the linear programming problem with a surprisingly simple and elegant proof of its polynomial behaviour. This is done both for the problem in standard form and for its dual problem. We also discuss some implementation strategies. 1436-4646 14364646 Springer |
| shingle_catch_all_4 | Roos, C. Vial, J. -Ph. A polynomial method of approximate centers for linear programming Interior-point method linear programming Karmarkar's method polynomial-time algorithm logarithmic barrier function path-following method Interior-point method linear programming Karmarkar's method polynomial-time algorithm logarithmic barrier function path-following method Abstract We present a path-following algorithm for the linear programming problem with a surprisingly simple and elegant proof of its polynomial behaviour. This is done both for the problem in standard form and for its dual problem. We also discuss some implementation strategies. 1436-4646 14364646 Springer |
| shingle_title_1 | A polynomial method of approximate centers for linear programming |
| shingle_title_2 | A polynomial method of approximate centers for linear programming |
| shingle_title_3 | A polynomial method of approximate centers for linear programming |
| shingle_title_4 | A polynomial method of approximate centers for linear programming |
| sigel_instance_filter | dkfz geomar wilbert ipn albert fhp |
| source_archive | Springer Online Journal Archives 1860-2000 |
| timestamp | 2024-05-06T09:48:57.140Z |
| titel | A polynomial method of approximate centers for linear programming |
| titel_suche | A polynomial method of approximate centers for linear programming |
| topic | SQ-SU SA-SP |
| uid | nat_lic_papers_NLM206327358 |