Interval analysis on directed acyclic graphs for global optimization (Q816066): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Applying interval arithmetic to real, integer, and boolean constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified integration of ODEs and flows using differential algebraic methods on high-order Taylor models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of interval slopes for the irrational part of factorable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taylor forms -- use and limits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Krawczyk operator and Kantorovich's theorem / rank
 
Normal rank

Revision as of 11:37, 24 June 2024

scientific article
Language Label Description Also known as
English
Interval analysis on directed acyclic graphs for global optimization
scientific article

    Statements

    Interval analysis on directed acyclic graphs for global optimization (English)
    0 references
    0 references
    0 references
    20 February 2006
    0 references
    A new representation method is discussed for solving global optimization problems using directed acyclic graphs. The method employs various techniques from interval analysis, round-off analysis, slope enclosures, forward and backward evaluation, automatic differentiation, constraint propagation, etc. For sufficiently sparse problems the computational work is proportional to the number of operations in the calculation of the objective function.
    0 references
    automatic differentiation
    0 references
    constraint propagation
    0 references
    interval analysis
    0 references
    directed acyclic graphs
    0 references
    global optimization
    0 references
    round-off analysis
    0 references
    slope enclosures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references