An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex Programming
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.
Source Title
Journal of Scientific Computing
ISSN
Faculty
Faculty of Science and Engineering
School
School of Elec Eng, Comp and Math Sci (EECMS)
Funding and Sponsorship
Collection
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.
Related items
Showing items related by title, author, creator and subject.
-
Loh, Ruen Chze (2010)Most of today’s computer communications use only a single (s,t) path to transmit a message from a source node s to a destination node t. There are two major problems with this single path communication. Firstly, the ...
-
Huo, Jiaquan (2004)The main theme of this thesis is the control of acoustic echoes for modem voice communication systems by means of echo cancellation. Two important issues in acoustic echo cancellation, namely the efficient adaptation of ...
-
Chai, Pey San Nancy (2011)Backhaul networks are used to interconnect access points and further connect them to gateway nodes which are located in regional or metropolitan centres. Conventionally, these backhaul networks are established using ...