A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
From MaRDI portal
Publication:2010085
Abstract: This paper proposes a joint decomposition method that combines La- grangian decomposition and generalized Benders decomposition, to efficiently solve multiscenario nonconvex mixed-integer nonlinear programming (MINLP) problems to global optimality, without the need for explicit branch and bound search. In this approach, we view the variables coupling the scenario dependent variables and those causing nonconvexity as complicating variables. We systemat- ically solve the Lagrangian decomposition subproblems and the generalized Ben- ders decomposition subproblems in a unified framework. The method requires the solution of a difficult relaxed master problem, but the problem is only solved when necessary. Enhancements to the method are made to reduce the number of the relaxed master problems to be solved and ease the solution of each relaxed master problem. We consider two scenario-based, two-stage stochastic nonconvex MINLP problems that arise from integrated design and operation of process net- works in the case study, and we show that the proposed method can solve the two problems significantly faster than state-of-the-art global optimization solvers.
Recommendations
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
- On a decomposition method for nonconvex global optimization
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- scientific article; zbMATH DE number 5630592
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A global optimization method for nonconvex separable programming problems
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- A decomposition-based solution method for stochastic mixed integer nonlinear programs
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
Cites work
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- A branch-and-reduce approach to global optimization
- A Cross Decomposition Algorithm for Capacitated Facility Location
- 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
- 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
- A new cross decomposition method for stochastic mixed-integer linear programming
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- An Algorithm for Separable Nonconvex Programming Problems
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Branch-and-price: Column generation for solving huge integer programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- CONOPT—A Large-Scale GRG Code
- Construction of convex relaxations using automated code generation techniques
- Cross decomposition for mixed integer programming
- Dual decomposition in stochastic integer programming
- Generalized Benders decomposition
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Handbook of test problems in local and global optimization
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Introduction to Stochastic Programming
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Mean value cross decomposition applied to integer programming problems
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- On the convergence of cross decomposition
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- Partitioning procedures for solving mixed-variables programming problems
- SCIP: solving constraint integer programs
- Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Validation of subgradient optimization
Cited in
(12)- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Non-convex nested Benders decomposition
- Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation
- 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
- DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- Nonconvex sensitivity-based generalized Benders decomposition
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- MUSE-BB: a decomposition algorithm for nonconvex two-stage problems using strong multisection branching
- On the convergence order of value function relaxations used in decomposition-based global optimization of nonconvex stochastic programs
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
This page was built for publication: A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010085)
