Fetching the paper…
Reading the bibliography…
The ADMM-based interior point (ABIP, Lin et al.
Foundations of portfolio theory
Harry M Markowitz · 1991
Earlier work this paper cites.
Interior-point polynomial algorithms in convex programming
Yurii Nesterov and Arkadii Nemirovskii · 1994
Earlier work this paper cites.
An O ( n \sqrt{n} L)-iteration homogeneous and self-dual linear programming algorithm
Yinyu Ye, Michael J Todd, and Shinji Mizuno · 1994
Earlier work this paper cites.
Support-vector networks
Corinna Cortes and Vladimir Vapnik · 1995
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
Robert Tibshirani · 1996
Earlier work this paper cites.
Duality results for conic convex programming
Z-Q. Luo, J.F. Sturm, and Shuzhong Zhang · 1997
Earlier work this paper cites.
Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones
Jos F Sturm · 1999
Earlier work this paper cites.
Sdpt3—a matlab software package for semidefinite programming, version 1.3
Kim-Chuan Toh, Michael J Todd, and Reha H Tütüncü · 1999
Earlier work this paper cites.
Numerical optimization
Stephen Wright, Jorge Nocedal, et al · 1999
Earlier work this paper cites.
Loqo: An interior point code for quadratic programming
Robert J Vanderbei · 1999
Earlier work this paper cites.
On a homogeneous algorithm for the monotone complementarity problem
Erling D Andersen and Yinyu Ye · 1999
Earlier work this paper cites.
A scaling algorithm to equilibrate both rows and columns norms in matrices
Daniel Ruiz · 2001
Earlier work this paper cites.
Second-order cone programming
Farid Alizadeh and Donald Goldfarb · 2003
Earlier work this paper cites.
The final netlib-lp results
Thorsten Koch · 2003
Earlier work this paper cites.
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
Guanglu Zhou and Kim-Chuan Toh · 2004
Earlier work this paper cites.
Convergence analysis of an inexact infeasible interior point method for semidefinite programming
Stefania Bellavia and Sandra Pieraccini · 2004
Cited alongside, same era.
A new self-dual embedding method for convex programming
Shuzhong Zhang · 2004
Cited alongside, same era.
Signal recovery by proximal forward-backward splitting
Patrick L Combettes and Valérie R Wajs · 2005
Cited alongside, same era.
An iterative solver-based infeasible primal-dual path-following algorithm for convex quadratic programming
Zhaosong Lu, Renato DC Monteiro, and Jerome W O’Neal · 2006
Cited alongside, same era.
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
Andreas Wächter and Lorenz T Biegler · 2006
Cited alongside, same era.
Convergence analysis of the inexact infeasible interior-point method for linear optimization
Superscs: fast and accurate large-scale conic optimization
Pantelis Sopasakis, Krina Menounou, and Panagiotis Patrinos · 2019
Later among the works it cites.
Infeasibility detection in the alternating direction method of multipliers for convex optimization
Goran Banjac, Paul Goulart, Bartolomeo Stellato, and Stephen Boyd · 2019
Later among the works it cites.
An admm-based interior-point method for large-scale linear programming
Tianyi Lin, Shiqian Ma, Yinyu Ye, and Shuzhong Zhang · 2020
Later among the works it cites.
Osqp: An operator splitting solver for quadratic programs
Bartolomeo Stellato, Goran Banjac, Paul Goulart, Alberto Bemporad, and Stephen Boyd · 2020
Later among the works it cites.
Restarting algorithms: sometimes there is free lunch
Sebastian Pokutta · 2020
Later among the works it cites.
Operator splitting for a homogeneous embedding of the linear complementarity problem
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ghussoun Al-Jeiroudi and Jacek Gondzio · 2009
Cited alongside, same era.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Stephen P. Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein · 2011
Cited alongside, same era.
A first-order primal-dual algorithm for convex problems with applications to imaging
Antonin Chambolle and Thomas Pock · 2011
Cited alongside, same era.
Diagonal preconditioning for first order primal-dual algorithms in convex optimization
Thomas Pock and Antonin Chambolle · 2011
Cited alongside, same era.
Libsvm: a library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Cited alongside, same era.
Subgradient methods for huge-scale optimization problems
Yu Nesterov · 2014
Cited alongside, same era.
SDPNAL + + : a majorized semismooth newton-cg augmented lagrangian method for semidefinite programming with nonnegative constraints
Liuqin Yang, Defeng Sun, and Kim-Chuan Toh · 2015
Cited alongside, same era.
Brendan O’Donoghue · 2021
Later among the works it cites.
Miplib 2017: data-driven compilation of the 6th mixed-integer programming library
Ambros Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff Linderoth, et al · 2021
Later among the works it cites.
Gurobi Optimizer Reference Manual, 2022
Gurobi Optimization, LLC · 2022
Closest in time.
Cardinal optimizer (copt) user guide
Dongdong Ge, Qi Huangfu, Zizhuo Wang, Jian Wu, and Yinyu Ye · 2022
Closest in time.
An interior point-proximal method of multipliers for linear positive semi-definite programming
Spyridon Pougkakiotis and Jacek Gondzio · 2022
Closest in time.
Papilo: A parallel presolving library for integer and linear programming with multiprecision support
Ambros Gleixner, Leona Gottwald, and Alexander Hoen · 2022
Closest in time.
Proximal stabilized interior point methods and low-frequency-update preconditioning techniques
Stefano Cipolla and Jacek Gondzio · 2023
Closest in time.
A new stopping criterion for krylov solvers applied in interior point methods
Filippo Zanetti and Jacek Gondzio · 2023
Closest in time.
SCS: Splitting conic solver, version 3.2.4
Brendan O’Donoghue, Eric Chu, Neal Parikh, and Stephen Boyd · 2023
Closest in time.
Suitesparse: A suite of sparse matrix packages
Tim Davis, I Duff, P Amestoy, J Gilbert, S Larimore, E Palamadai Natarajan, Y Chen, W Hager, and S Rajamanickam · 2024
Closest in time.