Fetching the paper…
Reading the bibliography…
Iterative Refinement (IR) is a classical computing technique for obtaining highly precise solutions to linear systems of equations, as well as linear optimization problems.
Wilkinson, J.H.: Rounding Errors in Algebraic Processes. Prentice Hall, Englewood Cliffs, NJ, USA (1963)
1963
Earlier work this paper cites.
Lovász, L.: On the Shannon capacity of a graph. IEEE Transactions on Information Theory 25
1979
Earlier work this paper cites.
Nesterov, Y.E., Nemirovskii, A.: A general approach to polynomial-time algorithms design for convex programming. Report, Central Economical and Mathematical Institute, USSR Academy of Sciences, Moscow (1988)
1988
Earlier work this paper cites.
Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. vol. 15. SIAM, Philadelphia, PA, USA (1994)
1994
Earlier work this paper cites.
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM) 42
1995
Earlier work this paper cites.
Nesterov, Y.E., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. vol. 13. SIAM, Philadelphia, PA, USA (1995)
1995
Earlier work this paper cites.
Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM Journal on Optimization 6
1996
Earlier work this paper cites.
Saunders, M.A., Tomlin, J.A.: Solving Regularized Linear Programs Using Barrier Methods and KKT Systems. vol. 10064. IBM Thomas J. Watson Research Center, NY, USA (1996)
1996
Earlier work this paper cites.
De Klerk, E., Roos, C., Terlaky, T.: Initialization in semidefinite programming via a self-dual skew-symmetric embedding. Operations Research Letters 20
1997
Earlier work this paper cites.
Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM Journal on Optimization 7
1997
Earlier work this paper cites.
Monteiro, R.D.: Primal–dual path-following algorithms for semidefinite programming. SIAM Journal on Optimization 7
1997
Earlier work this paper cites.
Nesterov, Y.E., Todd, M.J.: Self-scaled barriers and interior-point methods for convex programming. Mathematics of Operations Research 22
1997
Earlier work this paper cites.
Alizadeh, F., Haeberly, J.-P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM Journal on Optimization 8
1998
Earlier work this paper cites.
Kojima, M., Shida, M., Shindoh, S.: Local convergence of predictor—corrector infeasible-interior-point algorithms for SDPs and SDLCPs. Mathematical Programming 80
1998
Earlier work this paper cites.
Luo, Z.-Q., Sturm, J.F., Zhang, S.: Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming. SIAM Journal on Optimization 8
1998
Earlier work this paper cites.
Monteiro, R.D.: Polynomial convergence of primal-dual algorithms for semidefinite programming based on the Monteiro and Zhang family of directions. SIAM Journal on Optimization 8
1998
Earlier work this paper cites.
Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM Journal on Optimization 8
1998
Earlier work this paper cites.
Potra, F.A., Sheng, R.: A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming. SIAM Journal on Optimization 8
1998
Earlier work this paper cites.
Todd, M.J., Toh, K.-C., Tütüncü, R.H.: On the Nesterov–Todd direction in semidefinite programming. SIAM Journal on Optimization 8
1998
Earlier work this paper cites.
Zhang, Y.: On extending some primal–dual interior-point algorithms from linear programming to semidefinite programming. SIAM Journal on Optimization 8
1998
Earlier work this paper cites.
Ji, J., Potra, F.A., Sheng, R.: On the local convergence of a predictor-corrector method for semidefinite programming. SIAM Journal on Optimization 10
1999
Earlier work this paper cites.
Kojima, M., Shida, M., Shindoh, S.: A predictor-corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh–Haeberly–Overton search direction. SIAM Journal on Optimization 9
1999
Earlier work this paper cites.
Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM Journal on Optimization 10
2000
Earlier work this paper cites.
Rains, E.M.: A semidefinite program for distillable entanglement. IEEE Transactions on Information Theory 47
2001
Cited alongside, same era.
Burer, S., Monteiro, R.D.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming 95
2003
Cited alongside, same era.
Eldar, Y.C.: A semidefinite programming approach to optimal unambiguous discrimination of quantum states. IEEE Transactions on Information Theory 49
2003
Cited alongside, same era.
Monteiro, R.D.: First-and second-order methods for semidefinite programming. Mathematical Programming 97
2003
Cited alongside, same era.
Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia, PA, USA (2003)
2003
Cited alongside, same era.
Casares, P.A., Martin-Delgado, M.A.: A quantum interior-point predictor–corrector algorithm for linear programming. Journal of Physics A: Mathematical and Theoretical 53
2020
Later among the works it cites.
Gleixner, A., Steffy, D.E.: Linear programming using limited-precision oracles. Mathematical Programming 183
2020
Later among the works it cites.
Jiang, H., Kathuria, T., Lee, Y.T., Padmanabhan, S., Song, Z.: A faster interior point method for semidefinite programming. In: Irani, S., O’Conner, L., Kellenberger, P. (eds.) 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 910–918 (2020). IEEE
2020
Later among the works it cites.
Jiang, H., Lee, Y.T., Song, Z., Wong, S.C.-W.: An improved cutting plane method for convex optimization, convex-concave games, and its applications. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 944–953 (2020)
2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Bellavia, S., Pieraccini, S.: Convergence analysis of an inexact infeasible interior point method for semidefinite programming. Computational Optimization and Applications 29
2004
Cited alongside, same era.
Lanckriet, G.R., Cristianini, N., Bartlett, P., Ghaoui, L.E., Jordan, M.I.: Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research 5
2004
Cited alongside, same era.
Zhou, G., Toh, K.-C.: Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming. Mathematical Programming 99
2004
Cited alongside, same era.
De Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. vol. 65. Springer, Berlin, Germany (2006)
2006
Cited alongside, same era.
Weinberger, K.Q., Saul, L.K.: Unsupervised learning of image manifolds by semidefinite programming. International journal of computer vision 70
2006
Cited alongside, same era.
d’Aspremont, A., El Ghaoui, L., Jordan, M.I., Lanckriet, G.R.: A direct formulation for sparse PCA using semidefinite programming. SIAM Review 49
2007
Cited alongside, same era.
Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Physical Review Letters 103
2009
Cited alongside, same era.
Later among the works it cites.
Kerenidis, I., Prakash, A.: A quantum interior point method for LPs and SDPs. ACM Transactions on Quantum Computing 1
2020
Later among the works it cites.
Kerenidis, I., Prakash, A., Szilágyi, D.: Quantum algorithms for second-order cone programming and support vector machines. Quantum 5
2021
Later among the works it cites.
2021
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
Huang, B., Jiang, S., Song, Z., Tao, R., Zhang, R.: Solving SDP faster: A robust IPM framework and efficient implementation. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 233–244 (2022). IEEE
2022
Later among the works it cites.
2022
Later among the works it cites.
Mohammadisiahroudi, M., Wu, Z., Augustino, B., Terlaky, T., Carr, A.: Quantum-enhanced regression analysis using state-of-the-art QLSAs and QIPMs. In: 2022 IEEE/ACM 7th Symposium on Edge Computing (SEC), pp. 375–380 (2022). IEEE
2022
Later among the works it cites.
Apeldoorn, J., Cornelissen, A., Gilyén, A., Nannicini, G.: Quantum tomography using state-preparation unitaries. arXiv preprint (2022)
2022
Later among the works it cites.
2023
Closest in time.
Augustino, B., Nannicini, G., Terlaky, T., Zuluaga, L.F.: Quantum interior point methods for semidefinite optimization. Quantum 7
2023
Closest in time.
Mohammadisiahroudi, M., Terlaky, T.: In: Pardalos, P.M., Prokopyev, O.A. (eds.) Quantum IPMs for Linear Optimization, pp. 1–11. Springer, Cham (2023)
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Sim, C.-K.: Superlinear Convergence of an Interior Point Algorithm on Linear Semi-definite Feasibility Problems with Application to Linear Matrix Inequalities (2023)
2023
Closest in time.
Wu, Z., Mohammadisiahroudi, M., Augustino, B., Yang, X., Terlaky, T.: An inexact feasible quantum interior point method for linearly constrained quadratic optimization. Entropy 25
2023
Closest in time.
Sampourmahani, P., Mohammadisiahroudi, M., Terlaky, T.: On semidefinite representations of second-order conic optimization problems. Communications in Optimization Theory 12
2024
Closest in time.