Regularization in Regression with Bounded Noise: A Chebyshev Center Approach

DOI10.1137/060656784zbMath1171.90492OpenAlexW2147260252MaRDI QIDQ5301195

Amir Beck, Yonina C. Eldar

Publication date: 29 April 2008

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3a2c4345c8161524019eb6a62e04d250e495db47

zbMATH Keywords

strong dualityChebyshev centernonconvex quadratic optimizationbounded error estimation

Mathematics Subject Classification ID

Related Items (12)

A new approximate algorithm for the Chebyshev center ⋮ Learning from non-random data in Hilbert spaces: an optimal recovery perspective ⋮ Blind image deconvolution using a banded matrix method ⋮ An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization ⋮ Non-asymptotic bounds for the \(\ell_{\infty}\) estimator in linear regression with uniform noise ⋮ Optimal recovery from inaccurate data in Hilbert spaces: regularize, but what of the parameter? ⋮ Chebyshev center of the intersection of balls: complexity, relaxation and approximation ⋮ On Chebyshev Center of the Intersection of Two Ellipsoids ⋮ Chebyshev centres, Jung constants, and their applications ⋮ Chebyshev center and inscribed balls: properties and calculations ⋮ Optimal Inscribing of Two Balls into Polyhedral Set ⋮ Covering a set by a convex compactum: error estimates and computation

Uses Software

• SeDuMi

This page was built for publication: Regularization in Regression with Bounded Noise: A Chebyshev Center Approach