Skip to content

Commit

Permalink
Merge pull request #5514 from openjournals/joss.06605
Browse files Browse the repository at this point in the history 
Merging automatically
  • Loading branch information
@editorialbot
editorialbot authored Jun 19, 2024
2 parents 025871e + 91a375b commit 3c89996
Show file tree
Hide file tree
Showing 4 changed files with 737 additions and 0 deletions.
230 changes: 230 additions & 0 deletions joss.06605/10.21105.joss.06605.crossref.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,230 @@
<?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>20240619001026-8c71e669db341366d002709f14cf4e303f1377e2</doi_batch_id>
<timestamp>20240619001026</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>06</month>
<year>2024</year>
</publication_date>
<journal_volume>
<volume>9</volume>
</journal_volume>
<issue>98</issue>
</journal_issue>
<journal_article publication_type="full_text">
<titles>
<title>DynamicOED.jl: A Julia package for solving optimum
experimental design problems</title>
</titles>
<contributors>
<person_name sequence="first" contributor_role="author">
<given_name>Carl Julius</given_name>
<surname>Martensen</surname>
<ORCID>https://orcid.org/0000-0003-4143-3040</ORCID>
</person_name>
<person_name sequence="additional"
contributor_role="author">
<given_name>Christoph</given_name>
<surname>Plate</surname>
<ORCID>https://orcid.org/0000-0003-0354-8904</ORCID>
</person_name>
<person_name sequence="additional"
contributor_role="author">
<given_name>Sebastian</given_name>
<surname>Sager</surname>
<ORCID>https://orcid.org/0000-0002-0283-9075</ORCID>
</person_name>
</contributors>
<publication_date>
<month>06</month>
<day>19</day>
<year>2024</year>
</publication_date>
<pages>
<first_page>6605</first_page>
</pages>
<publisher_item>
<identifier id_type="doi">10.21105/joss.06605</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.12084055</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/6605</rel:inter_work_relation>
</rel:related_item>
</rel:program>
<doi_data>
<doi>10.21105/joss.06605</doi>
<resource>https://joss.theoj.org/papers/10.21105/joss.06605</resource>
<collection property="text-mining">
<item>
<resource mime_type="application/pdf">https://joss.theoj.org/papers/10.21105/joss.06605.pdf</resource>
</item>
</collection>
</doi_data>
<citation_list>
<citation key="bezanson2017julia">
<article_title>Julia: A fresh approach to numerical
computing</article_title>
<author>Bezanson</author>
<journal_title>SIAM Rev.</journal_title>
<issue>1</issue>
<volume>59</volume>
<doi>10.1137/141000671</doi>
<issn>0036-1445</issn>
<cYear>2017</cYear>
<unstructured_citation>Bezanson, J., Edelman, A., Karpinski,
S., &amp; Shah, V. B. (2017). Julia: A fresh approach to numerical
computing. SIAM Rev., 59(1), 65–98.
https://doi.org/10.1137/141000671</unstructured_citation>
</citation>
<citation key="rackauckas2017">
<article_title>DifferentialEquations.jl – a performant and
feature-rich ecosystem for solving differential equations in
Julia</article_title>
<author>Rackauckas</author>
<journal_title>The Journal of Open Research
Software</journal_title>
<issue>1</issue>
<volume>5</volume>
<doi>10.5334/jors.151</doi>
<cYear>2017</cYear>
<unstructured_citation>Rackauckas, C., &amp; Nie, Q. (2017).
DifferentialEquations.jl – a performant and feature-rich ecosystem for
solving differential equations in Julia. The Journal of Open Research
Software, 5(1). https://doi.org/10.5334/jors.151</unstructured_citation>
</citation>
<citation key="vaibhav_kumar_dixit_2023_7738525">
<article_title>Optimization.jl: A unified optimization
package</article_title>
<author>Dixit</author>
<doi>10.5281/zenodo.7738525</doi>
<cYear>2023</cYear>
<unstructured_citation>Dixit, V. K., &amp; Rackauckas, C.
(2023). Optimization.jl: A unified optimization package. Zenodo.
https://doi.org/10.5281/zenodo.7738525</unstructured_citation>
</citation>
<citation key="Koerkel2002">
<article_title>Numerische methoden für optimale
versuchsplanungsprobleme bei nichtlinearen DAE-Modellen</article_title>
<author>Körkel</author>
<doi>10.11588/heidok.00002980</doi>
<cYear>2002</cYear>
<unstructured_citation>Körkel, S. (2002). Numerische
methoden für optimale versuchsplanungsprobleme bei nichtlinearen
DAE-Modellen [PhD thesis, Universität Heidelberg].
https://doi.org/10.11588/heidok.00002980</unstructured_citation>
</citation>
<citation key="juniper">
<article_title>Juniper: An open-source nonlinear
branch-and-bound solver in Julia</article_title>
<author>Kröger</author>
<journal_title>Integration of Constraint Programming,
Artificial Intelligence, and Operations Research</journal_title>
<doi>10.1007/978-3-319-93031-2_27</doi>
<isbn>978-3-319-93031-2</isbn>
<cYear>2018</cYear>
<unstructured_citation>Kröger, O., Coffrin, C., Hijazi, H.,
&amp; Nagarajan, H. (2018). Juniper: An open-source nonlinear
branch-and-bound solver in Julia. In W.-J. van Hoeve (Ed.), Integration
of Constraint Programming, Artificial Intelligence, and Operations
Research (pp. 377–386). Springer International Publishing.
https://doi.org/10.1007/978-3-319-93031-2_27</unstructured_citation>
</citation>
<citation key="Li2000SensitivityAnalysisDifferential">
<article_title>Sensitivity analysis of
differential–algebraic equations: A comparison of methods on a special
problem</article_title>
<author>Li</author>
<journal_title>Applied Numerical Mathematics</journal_title>
<issue>2</issue>
<volume>32</volume>
<doi>10.1016/S0168-9274(99)00020-3</doi>
<issn>0168-9274</issn>
<cYear>2000</cYear>
<unstructured_citation>Li, S., Petzold, L., &amp; Zhu, W.
(2000). Sensitivity analysis of differential–algebraic equations: A
comparison of methods on a special problem. Applied Numerical
Mathematics, 32(2), 161–174.
https://doi.org/10.1016/S0168-9274(99)00020-3</unstructured_citation>
</citation>
<citation key="ma2021modelingtoolkit">
<article_title>ModelingToolkit: A composable graph
transformation system for equation-based modeling</article_title>
<author>Ma</author>
<doi>10.48550/arXiv.2103.05244</doi>
<cYear>2022</cYear>
<unstructured_citation>Ma, Y., Gowda, S., Anantharaman, R.,
Laughman, C., Shah, V., &amp; Rackauckas, C. (2022). ModelingToolkit: A
composable graph transformation system for equation-based modeling (No.
arXiv:2103.05244). arXiv.
https://doi.org/10.48550/arXiv.2103.05244</unstructured_citation>
</citation>
<citation key="Sager2013">
<article_title>Sampling decisions in optimum experimental
design in the light of Pontryagin’s maximum principle</article_title>
<author>Sager</author>
<journal_title>SIAM J. Control Optim.</journal_title>
<issue>4</issue>
<volume>51</volume>
<doi>10.1137/110835098</doi>
<issn>0363-0129</issn>
<cYear>2013</cYear>
<unstructured_citation>Sager, S. (2013). Sampling decisions
in optimum experimental design in the light of Pontryagin’s maximum
principle. SIAM J. Control Optim., 51(4), 3181–3207.
https://doi.org/10.1137/110835098</unstructured_citation>
</citation>
<citation key="Waechter2006">
<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</journal_title>
<issue>1</issue>
<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, 106(1), 25–57.
https://doi.org/10.1007/s10107-004-0559-y</unstructured_citation>
</citation>
</citation_list>
</journal_article>
</journal>
</body>
</doi_batch>
Binary file added joss.06605/10.21105.joss.06605.pdf
View file
Binary file not shown.
Loading

0 comments on commit 3c89996

Please sign in to comment.