Bi-affine scaling iterative method for convex quadratic programming with bound constraints
H Yue, P Shen - Mathematics and Computers in Simulation, 2024 - Elsevier
To solve general convex quadratic programming problems with bound constraints, this
paper proposes a new interior point iterative method that is easy to be implemented. The …
paper proposes a new interior point iterative method that is easy to be implemented. The …
A matrix-free interior point continuous trajectory for linearly constrained convex programming
X Qian, LZ Liao, J Sun - arxiv preprint arxiv:2412.20141, 2024 - arxiv.org
Interior point methods for solving linearly constrained convex programming involve a
variable projection matrix at each iteration to deal with the linear constraints. This matrix …
variable projection matrix at each iteration to deal with the linear constraints. This matrix …
An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex Programming
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 …
following a parameterized central path, which is a generalization of the central path and …