An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Couenne / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIDACO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BARON / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINDO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11786-014-0198-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006153942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for convex mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mixed integer nonlinear programs by outer approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic manipulation in the Bernstein form made simple via convolutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large MINLPs on computational grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different transformations for solving non-convex trim-loss problems by MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Search Strategies for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation and decomposition methods for mixed integer nonlinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for range computation of polynomials using the Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical study of MIDACO on 100 MINLP benchmarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast construction of constant bound functions for sparse polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univariate parameterization for global optimization of mixed-integer polynomial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A provable better Branch and Bound method for a nonconvex integer quadratic programming problem / rank
 
Normal rank

Latest revision as of 08:18, 9 July 2024

scientific article
Language Label Description Also known as
English
An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
scientific article

    Statements

    An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (English)
    0 references
    0 references
    0 references
    27 November 2014
    0 references
    Bernstein polynomials
    0 references
    branch-and-bound
    0 references
    global optimization
    0 references
    mixed-integer nonlinear programming
    0 references
    trim-loss problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers