Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix docs. #237

Merged
merged 7 commits into from
Dec 1, 2022
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/src/algorithm/index.rst
Original file line number Diff line number Diff line change
Expand Up @@ -48,7 +48,7 @@ The second step is the Euclidean projection onto a convex :ref:`cone <cones>`, i
\mbox{subject to } & z \in \mathcal{K}
\end{array}
over variable :math:`z`. Most cone projection operators have relatively simple
over variable :math:`z`. Many cones of interest have relatively simple
projection operators.

.. _optimality:
Expand Down
2 changes: 1 addition & 1 deletion docs/src/citing/index.rst
Original file line number Diff line number Diff line change
Expand Up @@ -51,7 +51,7 @@ If you wish to cite SCS, please use any of the following:
title = {{SCS}: Splitting Conic Solver, version 3.2.2},
howpublished = {\url{https://github.com/cvxgrp/scs}},
month = nov,
year = 2021
year = 2022
}

Anderson Acceleration
Expand Down