Skip to content

Commit

Permalink
Merge pull request #5372 from openjournals/joss.06226
Browse files Browse the repository at this point in the history 
Merging automatically
  • Loading branch information
@editorialbot
editorialbot authored May 22, 2024
2 parents 4faa557 + 61a23ed commit 6bbba14
Show file tree
Hide file tree
Showing 4 changed files with 1,021 additions and 0 deletions.
325 changes: 325 additions & 0 deletions joss.06226/10.21105.joss.06226.crossref.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,325 @@
<?xml version="1.0" encoding="UTF-8"?>
<doi_batch xmlns="http://www.crossref.org/schema/5.3.1"
xmlns:ai="http://www.crossref.org/AccessIndicators.xsd"
xmlns:rel="http://www.crossref.org/relations.xsd"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
version="5.3.1"
xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schemas/crossref5.3.1.xsd">
<head>
<doi_batch_id>20240522T131913-fdd929dc2d2df3e8831341831759570f1aa40f51</doi_batch_id>
<timestamp>20240522131913</timestamp>
<depositor>
<depositor_name>JOSS Admin</depositor_name>
<email_address>[email protected]</email_address>
</depositor>
<registrant>The Open Journal</registrant>
</head>
<body>
<journal>
<journal_metadata>
<full_title>Journal of Open Source Software</full_title>
<abbrev_title>JOSS</abbrev_title>
<issn media_type="electronic">2475-9066</issn>
<doi_data>
<doi>10.21105/joss</doi>
<resource>https://joss.theoj.org</resource>
</doi_data>
</journal_metadata>
<journal_issue>
<publication_date media_type="online">
<month>05</month>
<year>2024</year>
</publication_date>
<journal_volume>
<volume>9</volume>
</journal_volume>
<issue>97</issue>
</journal_issue>
<journal_article publication_type="full_text">
<titles>
<title>Enlsip.jl: A Julia optimization package to solve
constrained nonlinear least-squares problems</title>
</titles>
<contributors>
<person_name sequence="first" contributor_role="author">
<given_name>Pierre</given_name>
<surname>Borie</surname>
<ORCID>https://orcid.org/0009-0000-1043-5057</ORCID>
</person_name>
<person_name sequence="additional"
contributor_role="author">
<given_name>Alain</given_name>
<surname>Marcotte</surname>
<ORCID>https://orcid.org/0009-0009-5964-8892</ORCID>
</person_name>
<person_name sequence="additional"
contributor_role="author">
<given_name>Fabian</given_name>
<surname>Bastin</surname>
<ORCID>https://orcid.org/0000-0003-1323-6787</ORCID>
</person_name>
<person_name sequence="additional"
contributor_role="author">
<given_name>Stéphane</given_name>
<surname>Dellacherie</surname>
<ORCID>https://orcid.org/0009-0005-9043-9328</ORCID>
</person_name>
</contributors>
<publication_date>
<month>05</month>
<day>22</day>
<year>2024</year>
</publication_date>
<pages>
<first_page>6226</first_page>
</pages>
<publisher_item>
<identifier id_type="doi">10.21105/joss.06226</identifier>
</publisher_item>
<ai:program name="AccessIndicators">
<ai:license_ref applies_to="vor">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="am">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="tdm">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
</ai:program>
<rel:program>
<rel:related_item>
<rel:description>Software archive</rel:description>
<rel:inter_work_relation relationship-type="references" identifier-type="doi">10.5281/zenodo.11206280</rel:inter_work_relation>
</rel:related_item>
<rel:related_item>
<rel:description>GitHub review issue</rel:description>
<rel:inter_work_relation relationship-type="hasReview" identifier-type="uri">https://github.com/openjournals/joss-reviews/issues/6226</rel:inter_work_relation>
</rel:related_item>
</rel:program>
<doi_data>
<doi>10.21105/joss.06226</doi>
<resource>https://joss.theoj.org/papers/10.21105/joss.06226</resource>
<collection property="text-mining">
<item>
<resource mime_type="application/pdf">https://joss.theoj.org/papers/10.21105/joss.06226.pdf</resource>
</item>
</collection>
</doi_data>
<citation_list>
<citation key="grenieretal:2006">
<article_title>Short-term load forecasting at Hydro-Québec
TransÉnergie</article_title>
<author>Grenier</author>
<journal_title>2006 IEEE power engineering society general
meeting</journal_title>
<doi>10.1109/PES.2006.1709029</doi>
<cYear>2006</cYear>
<unstructured_citation>Grenier, M., Gagnon, J., Mercier, C.,
&amp; Richard, J. (2006). Short-term load forecasting at Hydro-Québec
TransÉnergie. 2006 IEEE Power Engineering Society General Meeting.
https://doi.org/10.1109/PES.2006.1709029</unstructured_citation>
</citation>
<citation key="lindstromwedin1988">
<article_title>Gauss-Newton based algorithms for constrained
nonlinear least squares problems</article_title>
<author>Lindström</author>
<journal_title>Technical Report S-901 87, Institute of
Information processing, University of Umeå, Sweden</journal_title>
<cYear>1988</cYear>
<unstructured_citation>Lindström, P., &amp; Wedin, P. Å.
(1988). Gauss-Newton based algorithms for constrained nonlinear least
squares problems. Technical Report S-901 87, Institute of Information
Processing, University of Umeå, Sweden.</unstructured_citation>
</citation>
<citation key="Julia:2017">
<article_title>Julia: A fresh approach to numerical
computing</article_title>
<author>Bezanson</author>
<journal_title>SIAM review</journal_title>
<issue>1</issue>
<volume>59</volume>
<doi>10.1137/141000671</doi>
<cYear>2017</cYear>
<unstructured_citation>Bezanson, J., Edelman, A., Karpinski,
S., &amp; Shah, V. B. (2017). Julia: A fresh approach to numerical
computing. SIAM Review, 59(1), 65–98.
https://doi.org/10.1137/141000671</unstructured_citation>
</citation>
<citation key="JuMP:2017">
<article_title>JuMP: A modeling language for mathematical
optimization</article_title>
<author>Dunning</author>
<journal_title>SIAM Review</journal_title>
<issue>2</issue>
<volume>59</volume>
<doi>10.1137/15M1020575</doi>
<cYear>2017</cYear>
<unstructured_citation>Dunning, I., Huchette, J., &amp;
Lubin, M. (2017). JuMP: A modeling language for mathematical
optimization. SIAM Review, 59(2), 295–320.
https://doi.org/10.1137/15M1020575</unstructured_citation>
</citation>
<citation key="nlp-models:2020">
<article_title>NLPModels.jl: Data structures for
optimization models</article_title>
<author>Orban</author>
<doi>10.5281/zenodo.2558627</doi>
<cYear>2020</cYear>
<unstructured_citation>Orban, D., Siqueira, A. S., &amp;
contributors. (2020). NLPModels.jl: Data structures for optimization
models. https://github.com/JuliaSmoothOptimizers/NLPModels.jl.
https://doi.org/10.5281/zenodo.2558627</unstructured_citation>
</citation>
<citation key="dennisetal:1981">
<article_title>An adaptive nonlinear least-squares
algorithm</article_title>
<author>Dennis Jr</author>
<journal_title>ACM Transactions on Mathematical
Software</journal_title>
<issue>3</issue>
<volume>7</volume>
<doi>10.1145/355958.355965</doi>
<issn>0098-3500</issn>
<cYear>1981</cYear>
<unstructured_citation>Dennis Jr, J. E., Gay, D. M., &amp;
Walsh, R. E. (1981). An adaptive nonlinear least-squares algorithm. ACM
Transactions on Mathematical Software, 7(3), 348–368.
https://doi.org/10.1145/355958.355965</unstructured_citation>
</citation>
<citation key="dolanmore:2002">
<article_title>Benchmarking optimization software with
performance profiles</article_title>
<author>Dolan</author>
<journal_title>Mathematical Programming</journal_title>
<issue>2</issue>
<volume>Series A 91</volume>
<doi>10.1007/s101070100263</doi>
<cYear>2002</cYear>
<unstructured_citation>Dolan, E. D., &amp; Moré, J. J.
(2002). Benchmarking optimization software with performance profiles.
Mathematical Programming, Series A 91(2), 201–213.
https://doi.org/10.1007/s101070100263</unstructured_citation>
</citation>
<citation key="orbansiquiera:2020">
<article_title>A regularization method for constrained
nonlinear least squares</article_title>
<author>Orban</author>
<journal_title>Computational Optimization and
Applications</journal_title>
<issue>3</issue>
<volume>76</volume>
<doi>10.1007/s10589-020-00201-2</doi>
<cYear>2020</cYear>
<unstructured_citation>Orban, D., &amp; Siqueira, A. S.
(2020). A regularization method for constrained nonlinear least squares.
Computational Optimization and Applications, 76(3), 961–989.
https://doi.org/10.1007/s10589-020-00201-2</unstructured_citation>
</citation>
<citation key="griewank:2003">
<article_title>A mathematical view of automatic
differentiation</article_title>
<author>Griewank</author>
<journal_title>Acta Numerica</journal_title>
<volume>12</volume>
<doi>10.1017/S0962492902000132</doi>
<cYear>2003</cYear>
<unstructured_citation>Griewank, A. (2003). A mathematical
view of automatic differentiation. Acta Numerica, 12, 321–398.
https://doi.org/10.1017/S0962492902000132</unstructured_citation>
</citation>
<citation key="linmore:1999a">
<article_title>Newton’s method for large bound-constrained
optimization problems</article_title>
<author>Lin</author>
<journal_title>SIAM Journal on Optimization</journal_title>
<issue>4</issue>
<volume>9</volume>
<doi>10.1137/S1052623498345075</doi>
<cYear>1999</cYear>
<unstructured_citation>Lin, C.-J., &amp; Moré, J. J. (1999).
Newton’s method for large bound-constrained optimization problems. SIAM
Journal on Optimization, 9(4), 1100–1127.
https://doi.org/10.1137/S1052623498345075</unstructured_citation>
</citation>
<citation key="lucksanvlcek:1999">
<article_title>Sparse and partially separable test problems
for unconstrained and equality constrained optimization</article_title>
<author>Lukšan</author>
<journal_title>Technical report 767, Institute of Computer
Science, Academy of Sciences of the Czech Republic,
Prague</journal_title>
<cYear>1999</cYear>
<unstructured_citation>Lukšan, L., &amp; Vlček, J. (1999).
Sparse and partially separable test problems for unconstrained and
equality constrained optimization. Technical Report 767, Institute of
Computer Science, Academy of Sciences of the Czech Republic, Prague.
http://hdl.handle.net/11104/0123965</unstructured_citation>
</citation>
<citation key="wachterbiegler:2006">
<article_title>On the implementation of an interior-point
filter line-search algorithm for large-scale nonlinear
programming</article_title>
<author>Wächter</author>
<journal_title>Mathematical Programming, Series
A</journal_title>
<volume>106</volume>
<doi>10.1007/s10107-004-0559-y</doi>
<cYear>2006</cYear>
<unstructured_citation>Wächter, A., &amp; Biegler, L. T.
(2006). On the implementation of an interior-point filter line-search
algorithm for large-scale nonlinear programming. Mathematical
Programming, Series A, 106, 25–57.
https://doi.org/10.1007/s10107-004-0559-y</unstructured_citation>
</citation>
<citation key="dennisschnabel:1996">
<volume_title>Numerical methods for unconstrained
optimization and nonlinear equations</volume_title>
<author>Dennis Jr</author>
<doi>10.1137/1.9781611971200</doi>
<cYear>1996</cYear>
<unstructured_citation>Dennis Jr, J. E., &amp; Schnabel, R.
B. (1996). Numerical methods for unconstrained optimization and
nonlinear equations. SIAM.
https://doi.org/10.1137/1.9781611971200</unstructured_citation>
</citation>
<citation key="gillmurraywright:1985">
<volume_title>Practical optimization</volume_title>
<author>Gill</author>
<doi>10.1137/1.9781611975604</doi>
<cYear>1981</cYear>
<unstructured_citation>Gill, P. E., Murray, W., &amp;
Wright, M. H. (1981). Practical optimization. Academic Press.
https://doi.org/10.1137/1.9781611975604</unstructured_citation>
</citation>
<citation key="hockschittkowski:1980">
<volume_title>Test examples for nonlinear programming
codes</volume_title>
<author>Hock</author>
<volume>187</volume>
<doi>10.1007/978-3-642-48320-2</doi>
<cYear>1980</cYear>
<unstructured_citation>Hock, W., &amp; Schittkowski, K.
(1980). Test examples for nonlinear programming codes (Second edition,
Vol. 187). Springer Berlin.
https://doi.org/10.1007/978-3-642-48320-2</unstructured_citation>
</citation>
<citation key="nocedalwright:2006">
<volume_title>Numerical optimization</volume_title>
<author>Nocedal</author>
<doi>10.1007/978-0-387-40065-5</doi>
<cYear>2006</cYear>
<unstructured_citation>Nocedal, J., &amp; Wright, S. J.
(2006). Numerical optimization (Second edition). Springer.
https://doi.org/10.1007/978-0-387-40065-5</unstructured_citation>
</citation>
<citation key="jsosolvers:2023">
<article_title>JSOSolvers.jl: JuliaSmoothOptimizers
optimization solvers</article_title>
<author>Migot</author>
<doi>10.5281/zenodo.3991143</doi>
<cYear>2023</cYear>
<unstructured_citation>Migot, T., Orban, D., Siqueira, A.
S., &amp; contributors. (2023). JSOSolvers.jl: JuliaSmoothOptimizers
optimization solvers (Version 0.11.0).
https://doi.org/10.5281/zenodo.3991143</unstructured_citation>
</citation>
</citation_list>
</journal_article>
</journal>
</body>
</doi_batch>
Binary file added joss.06226/10.21105.joss.06226.pdf
View file
Binary file not shown.
Loading

0 comments on commit 6bbba14

Please sign in to comment.