Decomposition-based inner- and outer-refinement algorithms for global optimization
From MaRDI portal
Recommendations
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- scientific article; zbMATH DE number 970355
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
Cites work
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1568156 (Why is no real title available?)
- A geometric study of dual gaps, with applications
- A polyhedral branch-and-cut approach to global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- Combination of nonlinear and linear optimization of transient gas networks
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Could we use a million cores to solve an integer program?
- Decomposition and dynamic cut generation in integer linear programming
- Decomposition in general mathematical programming
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- Generalized Benders decomposition
- Global minimization by reducing the duality gap
- Mixed-integer nonlinear optimization
- Pyomo -- optimization modeling in Python
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Selected Topics in Column Generation
- Solving mixed integer nonlinear programs by outer approximation
- The global solver in the LINDO API
- Une méthode d'optimisation non linéaire en variables mixtes pour la conception de procédés
Cited in
(12)- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- A column generation algorithm for solving energy system planning problems
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
- A DE-based scatter search for global optimization problems
- The supporting hyperplane optimization toolkit for convex MINLP
- A disjunctive cut strengthening technique for convex MINLP
- Decogo
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- Partially distributed outer approximation
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
This page was built for publication: Decomposition-based inner- and outer-refinement algorithms for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756777)
