Safe and tight linear estimators for global optimization (Q1774166): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s10107-004-0533-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081148668 / 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: Lower bound functions for polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized convex disjunctive programming: Nonlinear convex hull relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Polynomial Systems Using a Branch and Prune Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization and Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rigorous lower bound for the optimal value of convex optimization problems / 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: Safe bounds in linear and mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for linear fractional and bilinear programs / 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: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms / rank
 
Normal rank

Latest revision as of 10:42, 10 June 2024

scientific article
Language Label Description Also known as
English
Safe and tight linear estimators for global optimization
scientific article

    Statements

    Safe and tight linear estimators for global optimization (English)
    0 references
    29 April 2005
    0 references
    0 references
    global optimization
    0 references
    branch and bound algorithms
    0 references
    0 references