An asynchronous distributed-memory optimization solver for two-stage stochastic programming problems

Wang, J; Chiang, N; Petra, C G

Title: An asynchronous distributed-memory optimization solver for two-stage stochastic programming problems

Full Record
Other Related Research

Authors:

Wang, J ^[1]; Chiang, N ^[1]; Petra, C G ^[1]

Lawrence Livermore National Laboratory

Publication Date:: Thu Apr 01 00:00:00 EDT 2021

Research Org.:: Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

Sponsoring Org.:: USDOE National Nuclear Security Administration (NNSA)

OSTI Identifier:: 1798444

Report Number(s):: LLNL-CONF-821097
1032934

DOE Contract Number:: AC52-07NA27344

Resource Type:: Conference

Resource Relation:: Conference: Cluj-Napoca, null, Romania

Country of Publication:: United States

Language:: English

Subject:: Mathematics and Computing

Citation Formats


                    Wang, J, Chiang, N, and Petra, C G. An asynchronous distributed-memory optimization solver for two-stage stochastic programming problems.  United States: N. p., 2021. 
        Web.

Copy to clipboard


                    Wang, J, Chiang, N, & Petra, C G. An asynchronous distributed-memory optimization solver for two-stage stochastic programming problems.  United States.

Copy to clipboard


                    Wang, J, Chiang, N, and Petra, C G. 2021.  
        "An asynchronous distributed-memory optimization solver for two-stage stochastic programming problems".  United States.  https://www.osti.gov/servlets/purl/1798444.

Copy to clipboard


                    
@article{osti_1798444,

  title        = {An asynchronous distributed-memory optimization solver for two-stage stochastic programming problems},

  author       = {Wang, J and Chiang, N and Petra, C G},

  abstractNote = {},

  doi          = {},

  url          = {https://www.osti.gov/biblio/1798444},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {Thu Apr 01 00:00:00 EDT 2021},

  month        = {Thu Apr 01 00:00:00 EDT 2021}

}

Copy to clipboard

Conference:

View Conference (0.85 MB)

Other availability

Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

Journal Article Petra, Cosmin - Journal of Parallel and Distributed Computing

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations,more »« less
Cited by 11
https://doi.org/10.1016/j.jpdc.2018.10.009

Full Text Available
Optimizing Computation-Communication Overlap in Asynchronous Task-Based Programs

Conference Castillo, E; Jain, N; Casas, M; ...
https://doi.org/10.1145/3330345.3330379

Full Text Available
Optimizing Computation-Communication Overlap in Asynchronous Task-Based Programs

Conference Castillo, E; Jain, N; Casas, M; ...
https://doi.org/10.1145/3293883.3295720

Full Text Available
Recent Advances in PyROS: The Pyomo Solver for Two-Stage Nonconvex Robust Optimization

Conference Sherman, Jason; Isenberg, Natalie; Siirola, John; ...

The slides present recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. Overall, the results highlight the effectiveness of PyROSmore »« less
Full Text Available
Recent Advances in PyROS: The Pyomo Solver for Two-Stage Nonconvex Robust Optimization

Conference Sherman, Jason; Isenberg, Natalie; Siirola, John; ...

The slides present recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. Overall, the results highlight the effectiveness of PyROSmore »« less
Full Text Available

Similar Records