Computation of Minimal Projections and Extensions

DOI10.1080/01630563.2015.1091014zbMath1348.46013OpenAlexW2274535842MaRDI QIDQ2805984

Simon Foucart

Publication date: 13 May 2016

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2015.1091014

zbMATH Keywords

linear programmingsemidefinite programmingrobust optimizationconvex programsmatrix spacesminimal projectionsminimal extensionspolynomial spaces

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Numerical methods involving duality (49M29) Linear programming (90C05) Isometric theory of Banach spaces (46B04)

Related Items (4)

On maximal relative projection constants ⋮ Determining projection constants of univariate polynomial spaces ⋮ Instances of Computational Optimal Recovery: Dealing with Observation Errors ⋮ Instances of computational optimal recovery: refined approximability models

Cites Work

• Codimension-one minimal projections onto Haar subspaces
• Minimal projections on hyperplanes in sequence spaces
• Minimal projections onto two dimensional subspaces of \(l_ \infty^{(4)}\)
• Symmetric spaces with maximal projection constants
• Chalmers-Metcalf operator and uniqueness of minimal projections
• Determination of a minimal projection fromC[-1, 1 onto the quadratics]
• Theory and Applications of Robust Optimization
• Numerical estimation of projection constants
• Uniqueness of minimal projections onto two-dimensional subspaces
• Semidefinite Programming

This page was built for publication: Computation of Minimal Projections and Extensions