Skip to content

Fix typos in README.md #35

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.

Sign up for GitHub

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

Merged
merged 1 commit into from
Apr 7, 2025
Merged

Fix typos in README.md #35

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
4 changes: 2 additions & 2 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@
## Affiliation

This wrapper is maintained by the JuMP community and is not an official project
of [sburer](https://github.com/sburer).
of [`@sburer`](https://github.com/sburer).

## Getting help

Expand Down Expand Up @@ -55,7 +55,7 @@ searches for their rank-`r` factor `F` such that `X = F * F'`.

The advantage is that, as `F` is a `n × r` matrix, this decreases the number of
variables if `r < n`. The disadvantage is that the SDPLR is now solving a
nonconvex probem so it may converge to a solution that is not optimal.
nonconvex problem so it may converge to a solution that is not optimal.

The rule of thumb is: the larger `r` is, the more likely the solution you will
get is optimal but the smaller `r` is, the faster each iteration is
Expand Down
Loading