Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
type: Item
instance of: scholarly article
title: Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
zbMATH Open document ID: 1145.90428
author: L. G. Casado
author: E. M. T. Hendrix
author: I. García
published in: Journal of Global Optimization
publication date: 2008-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5281929
zbMATH Keywords: Blending
zbMATH Keywords: Branch-and-Bound
zbMATH Keywords: Quadratic programming
zbMATH Keywords: Robust solutions
MaRDI profile type: Publication
full work available at URL: s10898-007-9157-x
OpenAlex ID: W2122992783
cites work: D.C. versus copositive bounds for standard QP
cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
cites work: Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
cites work: On uniform covering, adaptive random search and raspberries
cites work: An application of Lipschitzian global optimization to product design
cites work: Finding robust solutions for product design problems
cites work: The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
cites work: On generalized bisection of 𝑛-simplices
cites work: Theoretical comparisons of search strategies in branch-and-bound algorithms
cites work: An algorithm for global optimization of Lipschitz continuous functions
cites work: Branch-and-Bound Methods: General Formulation and Properties
cites work: An algorithm for finding the global maximum of a multimodal, multivariate function
cites work: Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
cites work: Q3137910
DOI: 10.1007/S10898-007-9157-X
description: scientific article; zbMATH DE number 5281929