This paper proposes an inexact interior-point relaxation method (iIPRM) for LO problems that does not require its iterates to remain strictly positive and employs a sparse preconditioner tailored to the structure of the normal matrix.
Rui-Jin Zhang, Yu-Hong Dai, Xin-Wei Liu et al.· Journal of Optimization Theo...· 0 citations
Experiments on real-world traffic datasets demonstrate that MVCTD achieves accurate forecasts with favorable runtime under severe missingness, confirming its suitability for online traffic prediction.
This work proposes a multiscale primal-dual interior-point relaxation method (IPRM), which can handle instances whose full formulations contain trillions of transport variables and develops an effective support-identification strategy based on the approximate solutions obtained by IPRM.
Shengyun Sun, Rui-Jin Zhang, Ruoyu Diao et al.· 1 citation
A primal--dual interior-point method for nonsymmetric conic optimization based on a conjugate-free scaling matrix obtained from a single-secant BFGS update of the primal barrier Hessian, which attains an iteration bound of $\mathcal{O}(\sqrt{\nu}\log(1/\varepsilon)$ and is competitive with QICS, a specialized solver fo...