Analysis of some interior point continuous trajectories for convex programming
dc.contributor.author | Qian, X. | |
dc.contributor.author | Liao, L. | |
dc.contributor.author | Sun, Jie | |
dc.date.accessioned | 2017-04-28T13:59:16Z | |
dc.date.available | 2017-04-28T13:59:16Z | |
dc.date.created | 2017-04-28T09:06:07Z | |
dc.date.issued | 2017 | |
dc.identifier.citation | Qian, X. and Liao, L. and Sun, J. 2017. Analysis of some interior point continuous trajectories for convex programming. Optimization. 66 (4): pp. 589-608. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/52592 | |
dc.identifier.doi | 10.1080/02331934.2017.1279160 | |
dc.description.abstract |
In this paper, we analyse three interior point continuous trajectories for convex programming with general linear constraints. The three continuous trajectories are derived from the primal–dual path-following method, the primal–dual affine scaling method and the central path, respectively. Theoretical properties of the three interior point continuous trajectories are fully studied. The optimality and convergence of all three interior point continuous trajectories are obtained for any interior feasible point under some mild conditions. In particular, with proper choice of some parameters, the convergence for all three interior point continuous trajectories does not require the strict complementarity or the analyticity of the objective function. These results are new in the literature. | |
dc.publisher | Taylor & Francis Ltd. | |
dc.title | Analysis of some interior point continuous trajectories for convex programming | |
dc.type | Journal Article | |
dcterms.source.volume | 66 | |
dcterms.source.number | 4 | |
dcterms.source.startPage | 589 | |
dcterms.source.endPage | 608 | |
dcterms.source.issn | 0233-1934 | |
dcterms.source.title | Optimization | |
curtin.department | Department of Mathematics and Statistics | |
curtin.accessStatus | Open access |