On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
DOI10.1007/S11081-020-09576-XzbMATH Open1484.90050OpenAlexW3104942141MaRDI QIDQ2129200FDOQ2129200
Pavlo Muts, E. M. T. Hendrix, Ivo Nowak
Publication date: 22 April 2022
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-020-09576-x
Recommendations
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- Disjunctive Cuts for Nonconvex MINLP
- scientific article; zbMATH DE number 2068060
- Review of nonlinear mixed-integer and disjunctive programming techniques
global optimizationnonconvex optimizationmixed-integer nonlinear programmingparallel computingcolumn generationdecomposition method
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Selected Topics in Column Generation
- A polyhedral branch-and-cut approach to global optimization
- Title not available (Why is that?)
- 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
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- Pyomo -- optimization modeling in Python
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Cited In (2)
Uses Software
This page was built for publication: On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129200)