The following pages link to Arkadi Nemirovski (Q235037):
Displaying 50 items.
- Solving variational inequalities with monotone operators on domains given by linear minimization oracles (Q263192) (← links)
- Finding the stationary states of Markov chains by iterative methods (Q299414) (← links)
- Hypothesis testing via affine detectors (Q309575) (← links)
- Sparse non Gaussian component analysis by semidefinite programming (Q374189) (← links)
- On lower complexity bounds for large-scale smooth convex optimization (Q478994) (← links)
- Dual subgradient algorithms for large-scale nonsmooth learning problems (Q484132) (← links)
- Hypothesis testing by convex optimization (Q491378) (← links)
- Rejoinder of ``Hypothesis testing by convex optimization'' (Q491383) (← links)
- Conditional gradient algorithms for norm-regularized smooth convex optimization (Q494314) (← links)
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization (Q633105) (← links)
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions (Q633107) (← links)
- Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
- Nonparametric denoising of signals of unknown local structure. II: Nonparametric function recovery (Q711050) (← links)
- Validation analysis of mirror descent stochastic approximation method (Q715058) (← links)
- Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals (Q741817) (← links)
- On sequential hypotheses testing via convex optimization (Q747232) (← links)
- (Q786500) (redirect page) (← links)
- Prediction under conditions of indeterminacy (Q786501) (← links)
- Nonparametric estimation by convex programming (Q834340) (← links)
- Nonparametric denoising of signals with unknown local structure. I: Oracle inequalities (Q837541) (← links)
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm (Q868467) (← links)
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints (Q868470) (← links)
- Selected topics in robust convex optimization (Q995791) (← links)
- (Q1029545) (redirect page) (← links)
- Primal central paths and Riemannian distances for convex sets (Q1029546) (← links)
- Optimal adaptive control algorithms (Q1062946) (← links)
- Signal processing by the nonparametric maximum-likelihood method (Q1080582) (← links)
- Nonparametric estimation of functionals of the derivatives of a signal observed in white Gaussian noise (Q1124244) (← links)
- Optimization methods adapting to the problem of ''significant'' dimension (Q1135203) (← links)
- Recursive estimation of parameters of linear plants (Q1155554) (← links)
- Optimization of recursive algorithms of estimation of parameters of linear plants (Q1156752) (← links)
- On optimality of Krylov's information when solving linear operator equations (Q1179025) (← links)
- Information-based complexity of linear operator equations (Q1194382) (← links)
- Polynomial approximation of functions in a Hilbert space (Q1213587) (← links)
- On the general theory of the Laplace-Levy operator (Q1215937) (← links)
- On estimation of the \(L_r\) norm of a regression function (Q1284000) (← links)
- Robust solutions of uncertain linear programs (Q1306344) (← links)
- Several NP-hard problems arising in robust stability analysis (Q1312298) (← links)
- A network flow algorithm for just-in-time project scheduling (Q1342048) (← links)
- On parallel complexity of nonsmooth convex optimization (Q1342517) (← links)
- On spatially adaptive estimation of nonparametric regression (Q1368859) (← links)
- The projective method for solving linear matrix inequalities (Q1373734) (← links)
- The long-step method of analytic centers for fractional problems (Q1373735) (← links)
- Adjustable robust solutions of uncertain linear programs (Q1434080) (← links)
- Lectures on probability theory and statistics. École d'Été de Probabilités de Saint-Flour XXVIII - 1998. Summer school, Saint-Flour, France, August 17 -- September 3, 1998 (Q1572771) (← links)
- Robust solutions of linear programming problems contaminated with uncertain data (Q1587934) (← links)
- Change detection via affine and quadratic detectors (Q1689004) (← links)
- Near-optimality of linear recovery from indirect observations (Q1739121) (← links)
- ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312) (← links)
- Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171) (← links)
