Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
scientific article

    Statements

    Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    restart procedure
    0 references
    d.c. optimization.
    0 references
    branch-and-bound
    0 references
    global optimization
    0 references
    grid-search techniques
    0 references
    outer approximation
    0 references
    concave minimization
    0 references
    difference of two convex functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references