An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
DOI10.1007/S11786-014-0198-5zbMATH Open1302.90139OpenAlexW2006153942MaRDI QIDQ475423FDOQ475423
Authors: Bhagyesh V. Patil, P. 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
Recommendations
- The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems
- The Bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs
- 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
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
Bernstein polynomialsglobal optimizationmixed-integer nonlinear programmingbranch-and-boundtrim-loss problem
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11)
Cites Work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- A numerical study of MIDACO on 100 MINLP benchmarks
- A Computational Study of Search Strategies for Mixed Integer Programming
- Title not available (Why is that?)
- An algorithmic framework for convex mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Branching rules revisited
- Generalized Benders decomposition
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Title not available (Why is that?)
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- Different transformations for solving non-convex trim-loss problems by MINLP
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Title not available (Why is that?)
- 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.
- Fast construction of constant bound functions for sparse polynomials
- Branching and bounds tighteningtechniques for non-convex MINLP
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An efficient algorithm for range computation of polynomials using the Bernstein form
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
- Solving large MINLPs on computational grids
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Algebraic manipulation in the Bernstein form made simple via convolutions
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
Cited In (3)
Uses Software
This page was built for publication: An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475423)
