Techniques for exploring the suboptimal set
type: Item
instance of: scholarly article
title: Techniques for exploring the suboptimal set
zbMATH Open document ID: 1273.65089
author: Joëlle Skaf
author: Stephen Boyd
published in: Optimization and Engineering
publication date: 2013-10-24T00:00:00Z
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 6218675
zbMATH Keywords: convex optimization
zbMATH Keywords: suboptimal set
zbMATH Keywords: support function
zbMATH Keywords: ellipsoidal approximations
MaRDI profile type: Publication
full work available at URL: s11081-009-9101-7
OpenAlex ID: W2100284154
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Q4830373
cites work: Q4503250
cites work: Convex analysis and nonlinear optimization. Theory and examples
cites work: Linear Matrix Inequalities in System and Control Theory
cites work: Q4821526
cites work: A Minimax Chebyshev Estimator for Bounded Error Estimation
cites work: On the Estimation of a Convex Set From Noisy Data on Its Support Function
cites work: Geometric algorithms and combinatorial optimization
cites work: Convexity and well-posed problems
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Convex Analysis
cites work: Minimum Covering Ellipses
cites work: Probing convex polygons with half-planes
cites work: Computation of Minimum-Volume Covering Ellipsoids
cites work: Q5691079
cites work: Warm-start strategies in interior-point methods for linear programming
DOI: 10.1007/S11081-009-9101-7
description: scientific article; zbMATH DE number 6218675