Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
From MaRDI portal
Publication:662860
DOI10.1007/s10957-011-9888-1zbMath1245.90079OpenAlexW1970544310MaRDI QIDQ662860
Asgeir Tomasgard, Xiang Li, Paul I. Barton
Publication date: 13 February 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1721.1/122814
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Stochastic programming (90C15)
Related Items (24)
Natural gas production network infrastructure development under uncertainty ⋮ Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation ⋮ Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach ⋮ Computing tight bounds via piecewise linear functions through the example of circle cutting problems ⋮ The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems ⋮ An approximate bundle method for solving nonsmooth equilibrium problems ⋮ On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition ⋮ Nonconvex sensitivity-based generalized Benders decomposition ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ Data‐driven predictive control for a class of uncertain control‐affine systems ⋮ A risk-averse stochastic program for integrated system design and preventive maintenance planning ⋮ A new cross decomposition method for stochastic mixed-integer linear programming ⋮ Differentiable McCormick relaxations ⋮ A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints ⋮ A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs ⋮ A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables ⋮ 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 ⋮ A scalable global optimization algorithm for stochastic nonlinear programs ⋮ A decomposition approach for optimal gas network extension with a finite set of demand scenarios ⋮ A proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ A complementarity model for electric power transmission-distribution coordination under uncertainty ⋮ Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization ⋮ Non-convex nested Benders decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- Partitioning procedures for solving mixed-variables programming problems
- Handbook of test problems in local and global optimization
- Dual decomposition in stochastic integer programming
- Solving mixed integer nonlinear programs by outer approximation
- Variable metric bundle methods: From conceptual to implementable forms
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Construction of convex relaxations using automated code generation techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Generalized Benders decomposition
- McCormick-Based Relaxations of Algorithms
- Lectures on Stochastic Programming
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Introduction to Stochastic Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Canonical Cuts on the Unit Hypercube
This page was built for publication: Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
