A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
From MaRDI portal
Publication:2010085
DOI10.1007/s10898-019-00786-xzbMath1432.90092arXiv1802.07342OpenAlexW2963548325MaRDI QIDQ2010085
Publication date: 3 December 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.07342
global optimizationstochastic programmingDantzig-Wolfe decompositionLagrangian decompositionmixed integer nonlinear programminggeneralized Benders decompositionjoint decomposition
Related Items
Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation, Nonconvex sensitivity-based generalized Benders decomposition, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization, A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables, Non-convex nested Benders decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- A framework for globally optimizing mixed-integer signomial programs
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- SCIP: solving constraint integer programs
- On the convergence of cross decomposition
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- A multicut algorithm for two-stage stochastic linear programs
- Partitioning procedures for solving mixed-variables programming problems
- Mean value cross decomposition applied to integer programming problems
- Handbook of test problems in local and global optimization
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Dual decomposition in stochastic integer programming
- A new cross decomposition method for stochastic mixed-integer linear programming
- Construction of convex relaxations using automated code generation techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- Generalized Benders decomposition
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- CONOPT—A Large-Scale GRG Code
- Introduction to Stochastic Programming
- Cross decomposition for mixed integer programming
- Validation of subgradient optimization
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- An Algorithm for Separable Nonconvex Programming Problems
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
