Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
From MaRDI portal
Publication:3296380
DOI10.1007/978-3-030-22788-3_2zbMath1446.90109OpenAlexW2971359559MaRDI QIDQ3296380
Ivo Nowak, Pavlo Muts, Eligius M. T. Hendrix
Publication date: 7 July 2020
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-22788-3_2
Related Items (2)
A column generation algorithm for solving energy system planning problems ⋮ Partially distributed outer approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Decomposition in general mathematical programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Solving mixed integer nonlinear programs by outer approximation
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- On estimating workload in interval branch-and-bound global optimization algorithms
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Decomposition and dynamic cut generation in integer linear programming
- Generalized Benders decomposition
- Combination of Nonlinear and Linear Optimization of Transient Gas Networks
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- Selected Topics in Column Generation
- Mixed-integer nonlinear optimization
- Pyomo -- optimization modeling in Python
- A geometric study of dual gaps, with applications
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
This page was built for publication: Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
