Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints (Q925234): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
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/s10898-007-9157-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2122992783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: D.C. versus copositive bounds for standard QP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform covering, adaptive random search and raspberries / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of Lipschitzian global optimization to product design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding robust solutions for product design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The semi-continuous quadratic mixture design problem: description and branch-and-bound approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized bisection of 𝑛-simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical comparisons of search strategies in branch-and-bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for global optimization of Lipschitz continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Methods: General Formulation and Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the global maximum of a multimodal, multivariate function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137910 / rank
 
Normal rank

Latest revision as of 11:09, 28 June 2024

scientific article
Language Label Description Also known as
English
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
scientific article

    Statements

    Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints (English)
    0 references
    0 references
    0 references
    0 references
    3 June 2008
    0 references
    0 references
    Blending
    0 references
    Branch-and-Bound
    0 references
    Quadratic programming
    0 references
    Robust solutions
    0 references
    0 references