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) -
Solvlng Non-Linear First Order Ordinary Differential Equations.
by: Taremwa, Elias
Published: (2024) -
Decision procedure for first-order linear temporal logic with semi-periodic kemels
by: Regimantas Pliuškevičius
Published: (2002-12-01) -
Combinatorial Robust Optimization with Decision-Dependent Information Discovery and Polyhedral Uncertainty
by: Omer, Jérémy, et al.
Published: (2024-09-01) -
On the number of residues of certain second-order linear recurrences
by: Accossato, Federico, et al.
Published: (2024-11-01)