Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
type: Item
instance of: scholarly article
title: Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
zbMATH Open document ID: 1236.90084
author: Bhagyesh V. Patil
author: Sharad Bhartiya
author: P. S. V. Nataraj
published in: Computing
publication date: 2012-04-04T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65G30
zbMATH DE Number: 6022004
zbMATH Keywords: Bernstein polynomials
zbMATH Keywords: branch-and-bound
zbMATH Keywords: global optimization
zbMATH Keywords: mixed-integer nonlinear programming
describes a project that uses: LINDO
describes a project that uses: LogMIP
describes a project that uses: Matlab
describes a project that uses: Bonmin
describes a project that uses: GAMS
describes a project that uses: NEOS
describes a project that uses: SCICONIC
describes a project that uses: minlpBB
MaRDI profile type: Publication
full work available at URL: s00607-011-0175-7
OpenAlex ID: W2088886764
cites work: Q4331736
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: Generalized Benders decomposition
cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming
cites work: An algorithmic framework for convex mixed integer nonlinear programs
cites work: Relaxation and decomposition methods for mixed integer nonlinear programming.
cites work: The global solver in the LINDO API
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
cites work: Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
cites work: An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
cites work: An efficient algorithm for range computation of polynomials using the Bernstein form
cites work: A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
cites work: An efficient and safe framework for solving optimization problems
cites work: Algebraic manipulation in the Bernstein form made simple via convolutions
cites work: Fast construction of constant bound functions for sparse polynomials
cites work: Q4851610
cites work: Q4040272
cites work: Solving large MINLPs on computational grids
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: Branching rules revisited
cites work: Q3207999
DOI: 10.1007/S00607-011-0175-7
description: scientific article; zbMATH DE number 6022004