Improved Complexity Analysis of Full Nesterov-Todd Step Feasible Interior-Point Method for Symmetric Optimization

dc.contributor.author G. Q. Wang
dc.contributor.author L. C. Kong
dc.contributor.author J. Y. Tao
dc.contributor.author G. Lesaja
dc.contributor.author Tao, J.Y.
dc.contributor.author Wang, G.Q.
dc.contributor.author Kong, L.C.
dc.contributor.author Lesaja, G.
dc.date AUG
dc.date.accessioned 2025-10-06T16:23:01Z
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.
dc.description.sponsorship 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).
dc.description.sponsorship National Natural Science Foundation of China; Natural Science Foundation of Shanghai, (14ZR1418900); Natural Science Foundation of Shanghai; National Natural Science Foundation of China, NSFC, (11171018, 11471211); National Natural Science Foundation of China, NSFC
dc.description.sponsorship National Natural Science Foundation of China [11471211, 11171018]; Shanghai Natural Science Fund Project [14ZR1418900]
dc.identifier.doi 10.1007/s10957-014-0696-2
dc.identifier.issn 0022-3239
dc.identifier.issn 1573-2878
dc.identifier.scopus 2-s2.0-84937939954
dc.identifier.uri http://dx.doi.org/10.1007/s10957-014-0696-2
dc.identifier.uri https://gcris.yasar.edu.tr/handle/123456789/7633
dc.identifier.uri https://doi.org/10.1007/s10957-014-0696-2
dc.language.iso English
dc.publisher SPRINGER/PLENUM PUBLISHERS
dc.relation.ispartof Journal of Optimization Theory and Applications
dc.rights info:eu-repo/semantics/closedAccess
dc.source JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
dc.subject Interior-point methods, Euclidean Jordan algebras, Linear optimization over symmetric cones, Full Nesterov-Todd step, Polynomial complexity
dc.subject POLYNOMIAL CONVERGENCE, ALGORITHMS, CONES
dc.subject Polynomial Complexity
dc.subject Euclidean Jordan Algebras
dc.subject Linear Optimization over Symmetric Cones
dc.subject Interior-Point Methods
dc.subject Full Nesterov–Todd Step
dc.subject Full Nesterov-Todd Step
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.author.id Wang, Guoqiang/0000-0003-2979-3510
gdc.author.scopusid 8863495100
gdc.author.scopusid 6508317957
gdc.author.scopusid 59711390000
gdc.author.scopusid 11839849700
gdc.author.wosid Wang, Guoqiang/A-5009-2012
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.department
gdc.description.departmenttemp [Wang, G. Q.] Shanghai Univ Engn Sci, Coll Fundamental Studies, Shanghai 201620, Peoples R China; [Kong, L. C.] Beijing Jiaotong Univ, Dept Appl Math, Beijing 100044, Peoples R China; [Tao, J. Y.] Loyola Univ Maryland, Dept Math & Stat, Baltimore, MD 21210 USA; [Lesaja, G.] Yasar Univ, Dept Ind Engn, Izmir, Turkey
gdc.description.endpage 604
gdc.description.issue 2
gdc.description.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
gdc.description.startpage 588
gdc.description.volume 166
gdc.description.woscitationindex Science Citation Index Expanded
gdc.identifier.openalex W2079197798
gdc.identifier.wos WOS:000358266300012
gdc.index.type WoS
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
gdc.scopus.citedcount 14
gdc.wos.citedcount 16
oaire.citation.endPage 604
oaire.citation.startPage 588
project.funder.name National Natural Science Foundation of China [11471211- 11171018], Shanghai Natural Science Fund Project [14ZR1418900]
publicationissue.issueNumber 2
publicationvolume.volumeNumber 166
relation.isOrgUnitOfPublication ac5ddece-c76d-476d-ab30-e4d3029dee37
relation.isOrgUnitOfPublication.latestForDiscovery ac5ddece-c76d-476d-ab30-e4d3029dee37

Files