First order algorithms for computing linear and polyhedral estimates
It was recently shown [6, 8] that “properly built” linear and polyhedral estimates nearly attain minimax accuracy bounds in the problem of recovery of unknown signal from noisy observations of linear images of the signal when the signal set is an ellitope. However, design of nearly optimal estimates...
Saved in:
Main Authors: | Bekri, Yannis, Juditsky, Anatoli, Nemirovski, Arkadi |
---|---|
Format: | Article |
Language: | English |
Published: |
Université de Montpellier
2024-10-01
|
Series: | Open Journal of Mathematical Optimization |
Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.35/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Tight computationally efficient approximation of matrix norms with applications
by: Juditsky, Anatoli, et al.
Published: (2022-11-01) -
Multisphere Representation of Convex Polyhedral Particles for DEM Simulation
by: Qiang Zhang, et al.
Published: (2021-01-01) -
Estimation of the probability of failure during operation of a prefabricated cutting tool with replaceable polyhedral plates by nonparametric statistics methods
by: K. V. Syzrantseva, et al.
Published: (2023-06-01) -
Combinatorial Robust Optimization with Decision-Dependent Information Discovery and Polyhedral Uncertainty
by: Omer, Jérémy, et al.
Published: (2024-09-01) -
NONLINEAR PERTURBATIONS OF POLYHEDRAL NORMAL CONE MAPPINGS AND AFFINE VARIATIONAL INEQUALITIES
by: Nguyễn Thành Quí
Published: (2012-09-01)