Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
From MaRDI portal
Publication:3296380
DOI10.1007/978-3-030-22788-3_2zbMATH Open1446.90109OpenAlexW2971359559MaRDI QIDQ3296380FDOQ3296380
Authors: Ivo Nowak, Pavlo Muts, E. 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
Recommendations
- Decomposition Branching for Mixed Integer Programming
- A decomposition technique for mixed integer programming problems
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- Optimization techniques for tree-structured nonlinear problems
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- Multilevel decomposition in mixed-integer block programming
- Decomposition for solutions of large-scale multicriteria problems
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The global solver in the LINDO API
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Mixed-integer nonlinear optimization
- Selected Topics in Column Generation
- Solving mixed integer nonlinear programs by outer approximation
- A polyhedral branch-and-cut approach to global optimization
- Generalized Benders decomposition
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Title not available (Why is that?)
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- A geometric study of dual gaps, with applications
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Branching and bounds tighteningtechniques for non-convex MINLP
- Combination of nonlinear and linear optimization of transient gas networks
- Mathematical models of the delay constrained routing problem
- Decomposition and dynamic cut generation in integer linear programming
- Decomposition in general mathematical programming
- Pyomo -- optimization modeling in Python
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- On estimating workload in interval branch-and-bound global optimization algorithms
Cited In (6)
- DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- A column generation algorithm for solving energy system planning problems
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
- Partially distributed outer approximation
- Decomposition-based inner- and outer-refinement algorithms for global optimization
Uses Software
This page was built for publication: Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296380)
