An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
From MaRDI portal
(Redirected from Publication:475423)
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
Cites work
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 1971713 (Why is no real title available?)
- scientific article; zbMATH DE number 804609 (Why is no real title available?)
- A Computational Study of Search Strategies for Mixed Integer Programming
- A numerical study of MIDACO on 100 MINLP benchmarks
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
- 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
- An algorithmic framework for convex mixed integer nonlinear programs
- An efficient algorithm for range computation of polynomials using the Bernstein form
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Branching rules revisited
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Different transformations for solving non-convex trim-loss problems by MINLP
- Fast construction of constant bound functions for sparse polynomials
- Generalized Benders decomposition
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
- Solving large MINLPs on computational grids
- Solving mixed integer nonlinear programs by outer approximation
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(5)- The Bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs
- Matrix methods for the tensorial Bernstein form
- Kidney-inspired algorithm for optimization problems
- The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
Describes a project that uses
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)
