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

[JOSS review] typos in the paper #3

Closed
8 tasks done
tmigot opened this issue Feb 2, 2024 · 7 comments
Closed
8 tasks done

[JOSS review] typos in the paper #3

tmigot opened this issue Feb 2, 2024 · 7 comments

Comments

@tmigot
Copy link
Contributor

tmigot commented Feb 2, 2024

  • Typos:

    • At least once ENLSIP was noted ENLISP.
    • "It implements a nonlinear least squares under nonlinear constraints solver" -> "It implements a solver for nonlinear least squares with nonlinear constraints"
  • * Summary: Has a clear description of the high-level functionality and purpose of the software for a diverse, non-specialist audience been provided?* I think the theoretical guarantees offer by the solver should be clarified for a general audience. For instance, I assume this is not a global optimizer. In general, the paper should target a broad audience.

  • I think the paper lacks a brief description of the algorithm. It is not clear if this uses the second-order derivatives of the involved function or if the active-set strategy used in the paper is exactly the same as in the book by Nocedal & Wright ...

  • Data sharing: If the paper contains original data, data are accessible to the reviewers. If the paper contains no original data, please check this item. A large part of the discussion in the paper is comparing the Fortran version vs. the Julia version while there is no shared data on this.

  • This recent post could help the author expand the list of existing solvers for (unconstrained) NLS https://discourse.julialang.org/t/comparing-non-linear-least-squares-solvers/104752.

  • It would also help states why we consider the NLS case separately to the classical optimization case.

openjournals/joss-reviews#6226

@pierre-borie
Copy link
Collaborator

Thank you for your feedback and sorry for taking this much time to respond.
I agree on your suggestion to clarify the theoritical guarantees but shouldn't I redirect to the documentation for a description of the method? I might be wrong about it but I wanted to keep the optimization aspects of the paper brief and just state in what category the method belongs to.
Also thanks for the topic comparing least squares solvers packages!

@tmigot
Copy link
Contributor Author

tmigot commented Feb 27, 2024

It is true, though but it is possible to give a short description of the algorithm in 2-3 sentences.

@pierre-borie
Copy link
Collaborator

pierre-borie commented Apr 3, 2024

Hi! I just pushed a revised version of the paper of the joss-paper branch. I added a brief description of the algorithm and the theoretical guarantees in addition to a paragraph on comparison tests between Julia and Fortran.

@jbytecode
Copy link

Can we close this issue when it is done?

@tmigot
Copy link
Contributor Author

tmigot commented Apr 24, 2024

Hi @pierre-borie ! I have more comments regarding the paper:

  • Typos:
  • least squares OR least-squares
  • missing "problem" in first sentence (and elsewhere)
  • "This type of problems" plural/singular
    In general, please, revise carefully the English.
  • Mention somewhere that the aim is to find a local minimum of the problem. I noticed it is well done in the documentation of the package.
  • Is Figure 1 a Dolan&Moré performance profile? Why the percentage is 100% with 26 problems failed?
  • The package JSOSolvers.jl has least squares variants for the solvers TRUNK (unconstrained) and TRON (bound-constrained).
  • I would use citation for the different packages when available instead of just naming them. You can usually find citation file or use Github "Cite this repository" on packages' Github page.

@pierre-borie
Copy link
Collaborator

Hi @tmigot , thanks for your comments! Just to make sure I get these right:

  • I deliberatly distinguished "least squares" from "least-squares". I use the latter as an adjective, kind of, like in "least-squares problem" or "least-squares structure" but I'll uniformize it to avoid any ambiguities;
  • Figure 1 is indeed a "home made" Dolan-Moré performance profile; the percentage was still 100% because both versions failed on the same problems and we then excluded them from the test set, which is not very clear in the paper I agree. I'll replace the performance profile by a graph obtained with the BenchmarkProfiles.jl package and will correct the percentage issue at the same time.

@pierre-borie
Copy link
Collaborator

@tmigot - I submitted a new version of the paper that will, I hope, address your latest comments!

@tmigot tmigot closed this as completed May 1, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants