Updated link to admm_infeas paper (OO paper not updated)
@@ -9,7 +9,7 @@ If you use OSQP for published work, we encourage you to put a star on `GitHub <h
.. glossary::
Main paper
- Main algorithm description, derivation and benchmark available in this `preprint <https://arxiv.org/pdf/1711.08013.pdf>`__.
+ Main algorithm description, derivation and benchmark available in this `preprint <https://arxiv.org/pdf/1711.08013.pdf>`_.
.. code:: latex
@@ -28,20 +28,19 @@ If you use OSQP for published work, we encourage you to put a star on `GitHub <h
}
Infeasibility detection
- Infeasibility detection proofs using ADMM (also for general conic programs) in this `preprint <http://www.optimization-online.org/DB_FILE/2017/06/6058.pdf>`__.
+ Infeasibility detection proofs using ADMM (also for general conic programs) in this `preprint <https://stanford.edu/~boyd/papers/pdf/admm_infeas.pdf>`_.
.. code:: latex
@article{osqp-infeasibility,
title = {Infeasibility detection in the alternating direction method of multipliers for convex optimization},
author = {Banjac, G. and Goulart, P. and Stellato, B. and Boyd, S.},
- journal = {optimization-online.org},
year = {2017},
- url = {http://www.optimization-online.org/DB_HTML/2017/06/6058.html},
+ url = {https://stanford.edu/~boyd/papers/pdf/admm_infeas.pdf},
}
Code generation
- Code generation functionality and example in this `paper <http://stanford.edu/~boyd/papers/pdf/osqp_embedded.pdf>`__.
+ Code generation functionality and example in this `paper <http://stanford.edu/~boyd/papers/pdf/osqp_embedded.pdf>`_.
.. code:: latex
