File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s10107-023-02002-x
- Scopus: eid_2-s2.0-85165605644
- WOS: WOS:001035745000001
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Short-step Methods Are Not Strongly Polynomial-Time
| Title | Short-step Methods Are Not Strongly Polynomial-Time |
|---|---|
| Authors | |
| Issue Date | 1-Jan-2023 |
| Publisher | Springer |
| Citation | Mathematical Programming, 2023 How to Cite? |
| Abstract | Short-step methods are an important class of algorithms for solving convex constrained optimization problems. In this short paper, we show that under very mild assumptions on the self-concordant barrier and the width of the ℓ2-neighbourhood, any short-step interior-point method is not strongly polynomial-time. |
| Persistent Identifier | http://hdl.handle.net/10722/331932 |
| ISSN | 2023 Impact Factor: 2.2 2023 SCImago Journal Rankings: 1.982 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Zong, MR | - |
| dc.contributor.author | Lee, YT | - |
| dc.contributor.author | Yue, MC | - |
| dc.date.accessioned | 2023-09-28T04:59:42Z | - |
| dc.date.available | 2023-09-28T04:59:42Z | - |
| dc.date.issued | 2023-01-01 | - |
| dc.identifier.citation | Mathematical Programming, 2023 | - |
| dc.identifier.issn | 0025-5610 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/331932 | - |
| dc.description.abstract | <p>Short-step methods are an important class of algorithms for solving convex constrained optimization problems. In this short paper, we show that under very mild assumptions on the self-concordant barrier and the width of the ℓ2-neighbourhood, any short-step interior-point method is not strongly polynomial-time.<br></p> | - |
| dc.language | eng | - |
| dc.publisher | Springer | - |
| dc.relation.ispartof | Mathematical Programming | - |
| dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
| dc.title | Short-step Methods Are Not Strongly Polynomial-Time | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1007/s10107-023-02002-x | - |
| dc.identifier.scopus | eid_2-s2.0-85165605644 | - |
| dc.identifier.eissn | 1436-4646 | - |
| dc.identifier.isi | WOS:001035745000001 | - |
| dc.identifier.issnl | 0025-5610 | - |