An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex Programming
dc.contributor.author | Hou, L. | |
dc.contributor.author | Qian, X. | |
dc.contributor.author | Liao, L.Z. | |
dc.contributor.author | Sun, Jie | |
dc.date.accessioned | 2023-04-16T09:08:41Z | |
dc.date.available | 2023-04-16T09:08:41Z | |
dc.date.issued | 2022 | |
dc.identifier.citation | Hou, L. and Qian, X. and Liao, L.Z. and Sun, J. 2022. An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex Programming. Journal of Scientific Computing. 90 (3): ARTN 95. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/91422 | |
dc.identifier.doi | 10.1007/s10915-022-01765-3 | |
dc.description.abstract |
An interior point algorithm is proposed for linearly constrained convex programming following a parameterized central path, which is a generalization of the central path and requires weaker convergence conditions. The convergence and polynomial-time complexity of the proposed algorithm are proved under the assumption that the Hessian of the objective function is locally Lipschitz continuous. In addition, an initialization strategy is proposed and some numerical results are provided to show the efficiency and attractiveness of the proposed algorithm. | |
dc.language | English | |
dc.publisher | SPRINGER/PLENUM PUBLISHERS | |
dc.relation.sponsoredby | http://purl.org/au-research/grants/arc/DP160102918 | |
dc.subject | Science & Technology | |
dc.subject | Physical Sciences | |
dc.subject | Mathematics, Applied | |
dc.subject | Mathematics | |
dc.subject | Interior point method | |
dc.subject | Path following | |
dc.subject | Polynomial-time complexity | |
dc.subject | Convex programming | |
dc.subject | POTENTIAL REDUCTION ALGORITHM | |
dc.subject | SCALING CONTINUOUS TRAJECTORIES | |
dc.subject | PREDICTOR-CORRECTOR ALGORITHM | |
dc.subject | CONTINUATION-SMOOTHING METHOD | |
dc.subject | POLYNOMIAL-TIME ALGORITHM | |
dc.subject | PRIMAL-DUAL ALGORITHMS | |
dc.subject | LIMITING BEHAVIOR | |
dc.subject | CONVERGENCE | |
dc.subject | COMPLEXITY | |
dc.title | An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex Programming | |
dc.type | Journal Article | |
dcterms.source.volume | 90 | |
dcterms.source.number | 3 | |
dcterms.source.issn | 0885-7474 | |
dcterms.source.title | Journal of Scientific Computing | |
dc.date.updated | 2023-04-16T09:08:40Z | |
curtin.department | School of Elec Eng, Comp and Math Sci (EECMS) | |
curtin.accessStatus | Fulltext not available | |
curtin.faculty | Faculty of Science and Engineering | |
curtin.contributor.orcid | Sun, Jie [0000-0001-5611-1672] | |
curtin.contributor.researcherid | Sun, Jie [B-7926-2016] [G-3522-2010] | |
curtin.identifier.article-number | ARTN 95 | |
dcterms.source.eissn | 1573-7691 | |
curtin.contributor.scopusauthorid | Sun, Jie [16312754600] [57190212842] | |
curtin.repositoryagreement | V3 |