An improved Bernstein global optimization algorithm for MINLP problems with application in process industry

DOI10.1007/s11786-014-0198-5zbMath1302.90139OpenAlexW2006153942MaRDI QIDQ475423

Bhagyesh V. Patil, Paluri S. V. Nataraj

Publication date: 27 November 2014

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-014-0198-5

zbMATH Keywords

global optimizationBernstein polynomialsbranch-and-boundmixed-integer nonlinear programmingtrim-loss problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Related Items (2)

Kidney-inspired algorithm for optimization problems ⋮ Matrix methods for the tensorial Bernstein form

Uses Software

• BARON
• Matlab
• SCICONIC
• Couenne
• LINDO
• Bonmin
• MIDACO
• DICOPT
• AlphaECP
• LINGO
• GAMS
• LogMIP
• NEOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
• Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
• Algebraic manipulation in the Bernstein form made simple via convolutions
• An algorithmic framework for convex mixed integer nonlinear programs
• An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
• Fast construction of constant bound functions for sparse polynomials
• An efficient algorithm for range computation of polynomials using the Bernstein form
• Different transformations for solving non-convex trim-loss problems by MINLP
• Solving mixed integer nonlinear programs by outer approximation
• A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Solving large MINLPs on computational grids
• Branching rules revisited
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• Univariate parameterization for global optimization of mixed-integer polynomial problems
• Relaxation and decomposition methods for mixed integer nonlinear programming.
• Generalized Benders decomposition
• MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
• A numerical study of MIDACO on 100 MINLP benchmarks
• Branching and bounds tighteningtechniques for non-convex MINLP
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
• A Computational Study of Search Strategies for Mixed Integer Programming

This page was built for publication: An improved Bernstein global optimization algorithm for MINLP problems with application in process industry