Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization
| dc.contributor.author | Guoqiang Wang | |
| dc.contributor.author | Lingcheng Chen Kong | |
| dc.contributor.author | Jiyuan Tao | |
| dc.contributor.author | Goran Lešaja | |
| dc.date.accessioned | 2025-10-06T17:52:20Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | In this paper an improved complexity analysis of full Nesterov–Todd step feasible interior-point method for symmetric optimization is considered. Specifically we establish a sharper quadratic convergence result using several new results from Euclidean Jordan algebras which leads to a wider quadratic convergence neighbourhood of the central path for the iterates in the algorithm. Furthermore we derive the currently best known iteration bound for full Nesterov–Todd step feasible interior-point method. © 2022 Elsevier B.V. All rights reserved. | |
| dc.identifier.doi | 10.1007/s10957-014-0696-2 | |
| dc.identifier.issn | 00223239, 15732878 | |
| dc.identifier.issn | 0022-3239 | |
| dc.identifier.issn | 1573-2878 | |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84937939954&doi=10.1007%2Fs10957-014-0696-2&partnerID=40&md5=3bc0ff52eaf46ad16ae5bf04578d7878 | |
| dc.identifier.uri | https://gcris.yasar.edu.tr/handle/123456789/9889 | |
| dc.language.iso | English | |
| dc.publisher | Springer Science and Business Media LLC | |
| dc.relation.ispartof | Journal of Optimization Theory and Applications | |
| dc.source | Journal of Optimization Theory and Applications | |
| dc.subject | Euclidean Jordan Algebras, Full Nesterov–todd Step, Interior-point Methods, Linear Optimization Over Symmetric Cones, Polynomial Complexity, Algebra, Iterative Methods, Complexity Analysis, Euclidean Jordan Algebra, Full Nesterov–todd Step, Interior-point Method, Linear Optimization, Linear Optimization Over Symmetric Cone, Polynomial Complexity, Quadratic Convergence, Symmetric Cone, Symmetric Optimizations, Linear Programming | |
| dc.subject | Algebra, Iterative methods, Complexity analysis, Euclidean Jordan algebra, Full nesterov–todd step, Interior-point method, Linear optimization, Linear optimization over symmetric cone, Polynomial complexity, Quadratic convergence, Symmetric cone, Symmetric optimizations, Linear programming | |
| dc.title | Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization | |
| dc.type | Article | |
| dspace.entity.type | Publication | |
| gdc.bip.impulseclass | C4 | |
| gdc.bip.influenceclass | C4 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.type | text::journal::journal article | |
| gdc.collaboration.industrial | false | |
| gdc.description.endpage | 604 | |
| gdc.description.startpage | 588 | |
| gdc.description.volume | 166 | |
| gdc.identifier.openalex | W2079197798 | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 9.0 | |
| gdc.oaire.influence | 3.7240258E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Polynomial complexity | |
| gdc.oaire.keywords | polynomial complexity | |
| gdc.oaire.keywords | Interior-point methods | |
| gdc.oaire.keywords | Education | |
| gdc.oaire.keywords | linear optimization over symmetric cones | |
| gdc.oaire.keywords | Full Nesterov–Todd step | |
| gdc.oaire.keywords | Linear optimization over symmetric cones | |
| gdc.oaire.keywords | Euclidean Jordan algebras | |
| gdc.oaire.keywords | Linear programming | |
| gdc.oaire.keywords | interior-point methods | |
| gdc.oaire.keywords | full Nesterov-Todd step | |
| gdc.oaire.keywords | Mathematics | |
| gdc.oaire.popularity | 2.2878965E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0211 other engineering and technologies | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.oaire.sciencefields | 01 natural sciences | |
| gdc.oaire.sciencefields | 0101 mathematics | |
| gdc.openalex.collaboration | International | |
| gdc.openalex.fwci | 4.9217 | |
| gdc.openalex.normalizedpercentile | 0.95 | |
| gdc.openalex.toppercent | TOP 10% | |
| gdc.opencitations.count | 13 | |
| gdc.plumx.crossrefcites | 13 | |
| gdc.plumx.mendeley | 2 | |
| gdc.plumx.scopuscites | 14 | |
| oaire.citation.endPage | 604 | |
| oaire.citation.startPage | 588 | |
| person.identifier.scopus-author-id | Wang- Guoqiang (8863495100), Kong- Lingcheng Chen (59711390000), Tao- Jiyuan (11839849700), Lešaja- Goran (6508317957) | |
| project.funder.name | The first author would like to thank Dr. Guoyong Gu (Nanjing University) for his insightful comments and suggestions on an earlier draft of this article. The authors would like to thank the handling editor and the anonymous referees for their useful comments and suggestions which helped to improve the presentation of this paper. This work was supported by National Natural Science Foundation of China (Nos. 11471211 11171018) and Shanghai Natural Science Fund Project (No. 14ZR1418900). | |
| publicationissue.issueNumber | 2 | |
| publicationvolume.volumeNumber | 166 | |
| relation.isOrgUnitOfPublication | ac5ddece-c76d-476d-ab30-e4d3029dee37 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | ac5ddece-c76d-476d-ab30-e4d3029dee37 |