A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x

RESOURCE

Abstract

In this software, we implement an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) to global optimality. The algorithm combines ideas that exploit the structure of convex relaxations to MINLPs and bound tightening procedures
Developers:
Bent, Rusell [1] Nagarajan, Harsha [1] Sundar, Kaarthik [1] Wang, Site [1] Hijazi, Hassan [1]
  1. LANL
Release Date:
2017-09-25
Project Type:
Open Source, Publicly Available Repository
Software Type:
Scientific
Programming Languages:
Julia, C++
Licenses:
Other (Commercial or Open-Source): https://github.com/lanl-ansi/Alpine.jl/blob/master/LICENSE.md
Sponsoring Org.:
Code ID:
45480
Site Accession Number:
C17097; 7719
Research Org.:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Country of Origin:
United States

RESOURCE

Citation Formats

Bent, Rusell, Nagarajan, Harsha, Sundar, Kaarthik, Wang, Site, and Hijazi, Hassan. A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x. Computer Software. https://github.com/lanl-ansi/Alpine.jl. USDOE. 25 Sep. 2017. Web. doi:10.11578/dc.20201001.37.
Bent, Rusell, Nagarajan, Harsha, Sundar, Kaarthik, Wang, Site, & Hijazi, Hassan. (2017, September 25). A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x. [Computer software]. https://github.com/lanl-ansi/Alpine.jl. https://doi.org/10.11578/dc.20201001.37.
Bent, Rusell, Nagarajan, Harsha, Sundar, Kaarthik, Wang, Site, and Hijazi, Hassan. "A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x." Computer software. September 25, 2017. https://github.com/lanl-ansi/Alpine.jl. https://doi.org/10.11578/dc.20201001.37.
@misc{ doecode_45480,
title = {A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x},
author = {Bent, Rusell and Nagarajan, Harsha and Sundar, Kaarthik and Wang, Site and Hijazi, Hassan},
abstractNote = {In this software, we implement an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) to global optimality. The algorithm combines ideas that exploit the structure of convex relaxations to MINLPs and bound tightening procedures},
doi = {10.11578/dc.20201001.37},
url = {https://doi.org/10.11578/dc.20201001.37},
howpublished = {[Computer Software] \url{https://doi.org/10.11578/dc.20201001.37}},
year = {2017},
month = {sep}
}