On decomposition and multiobjective-based column and disjunctive cut generation for MINLP

DOI10.1007/S11081-020-09576-XMaRDI QIDQ2129200zbMATH OpenOpenAlexFDO

Authors Pavlo Muts, Ivo Nowak, E. M. T. Hendrix

Publication date 22 April 2022

Published in Optimization and Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11081-020-09576-x

zbMATH Keywords

global optimizationnonconvex optimizationmixed-integer nonlinear programmingparallel computingcolumn generationdecomposition method

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Mixed integer programming (90C11)

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

Cites work

• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 976350 (Why is no real title available?)
• scientific article; zbMATH DE number 2002582 (Why is no real title available?)
• scientific article; zbMATH DE number 2121076 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A geometric study of dual gaps, with applications
• A polyhedral branch-and-cut approach to global optimization
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
• Decomposition-based inner- and outer-refinement algorithms for global optimization
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Pyomo -- optimization modeling in Python
• Relaxation and decomposition methods for mixed integer nonlinear programming.
• Selected Topics in Column Generation
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming

Cited in

(4)

• A column generation algorithm for solving energy system planning problems
• Decomposition-based inner- and outer-refinement algorithms for global optimization
• Column enumeration based decomposition techniques for a class of non-convex MINLP problems
• Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes

Describes a project that uses

Uses Software

• SCIP
• Ipopt
• Pyomo
• MINLPLib
• SHOT
• Decogo

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)