Nemirovskij, Arkadij Semenovič 1947-...
Аркадий Семёнович Немировский
Nemirovskiĭ, A. S. (Arkadiĭ Semenovich)
Nemirovskiĭ, Arkadiĭ, 1947-....
Nemirovskij, Arkadij S. 1947-
Nemirovskij, A. S.
Nemirovskiĭ, Arkadiĭ Semenovich, 1947-
Nemirovskiĭ, Arkadiĭ Semenovich
Nemirovskij, A.S. (Arkadij Seminovič)
נמירובסקי, ארקדי
Немировский, Аркадий Семенович 1947-
VIAF ID: 268693876 (Personal)
Permalink: http://viaf.org/viaf/268693876
Preferred Forms
- 100 1 _ ‡a Nemirovskiĭ, A. S. ‡q (Arkadiĭ Semenovich)
-
-
-
- 100 1 _ ‡a Nemirovskiĭ, Arkadiĭ, ‡d 1947-....
- 200 _ | ‡a Nemirovskij ‡b Arkadij Semenovič ‡f 1947-....
-
-
- 100 1 _ ‡a Nemirovskij, Arkadij S. ‡d 1947-
-
- 100 1 _ ‡a Nemirovskij, Arkadij Semenovič ‡d 1947-...
- 100 1 _ ‡a Nemirovskiĭ, Arkadiĭ Semenovich
-
- 100 0 _ ‡a Аркадий Семёнович Немировский
-
-
4xx's: Alternate Name Forms (62)
5xx's: Related Names (2)
- 510 2 _ ‡a Georgia Institute of Technology
- 510 2 _ ‡a Georgia Institute of Technology ‡4 affi ‡4 http://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
Works
Title | Sources |
---|---|
Absence of Eigenvalues for Quasi-Periodic Lattice Operators with Liouville Frequencies | |
Accuracy Certificates for Computational Problems with Convex Structure | |
Accuracy guaranties for $\ell_{1}$ recovery of block-sparse signals | |
Adaptive de-noising of signals satisfying differential inequalities | |
Cascading — an approach to robust material optimization | |
Conditional gradient algorithms for norm-regularized smooth convex optimization | |
?Cone-free? primal-dual path-following and potential-reduction polynomial time interior-point methods | |
The design and implementation of COSEM, an iterative algorithm for fully 3-D listmode data. | |
Discussion on: “Why Is Resorting to Fate Wise? A Critical Look at Randomized Algorithms in Systems and Control” | |
Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems | |
Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems | |
Finding the stationary states of Markov chains by iterative methods | |
Foreword: special issue on robust optimization | |
Hypothesis testing via affine detectors | |
Interior-point polynomial algorithms in convex programming | |
Introduction to linear optimization, 2024: | |
Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm | |
Lectures on modern convex optimization : analysis, algorithms, and engineering applications | |
Lectures on probability theory and statistics : École d'été de probabilités de Saint-Flour XXVIII - 1998 | |
Linear Minimax Regret Estimation of Deterministic Parameters with Bounded Data Uncertainties | |
LMI control toolbox for use with MATLAB | |
The long-step method of analytic centers for fractional problems | |
Matematicheskie metody optimizat︠s︡ii ustroĭstv i algoritmov ASU | |
Mirror Prox algorithm for multi-term composite minimization and semi-separable problems | |
New variants of bundle methods | |
Non-asymptotic confidence bounds for the optimal value of a stochastic program | |
Non-euclidean restricted memory level method for large-scale convex optimization | |
Nonparametric denoising signals of unknown local structure, II: Nonparametric function recovery | |
On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures | |
On detecting harmonic oscillations | |
On estimation of non-smooth functionals | |
On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing | |
On lower complexity bounds for large-scale smooth convex optimization | |
On maximization of quadratic form over intersection of ellipsoids with common center | |
On nonparametric tests of positivity/monotonicity/convexity | |
On Polyhedral Approximations of the Second-Order Cone | |
On safe tractable approximations of chance constraints | |
On sparse representation in pairs of bases | |
Optimal Design of Trusses Under a Nonconvex Global Buckling Constraint | |
Optimal Halbach Permanent Magnet Designs for Maximally Pulling and Pushing Nanoparticles | |
The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography | |
Participation in auctions | |
Probability-Constrained Approach to Estimation of Random Gaussian Parameters | |
Problem complexity and method efficiency in optimization | |
Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems | |
Randomized first order algorithms with applications to ℓ 1-minimization | |
A Randomized Mirror-Prox Method for Solving Structured Large-Scale Matrix Saddle-Point Problems | |
Rejoinder of “Hypothesis testing by convex optimization” | |
Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach | |
Robust mean-squared error estimation in the presence of model uncertainties | |
Robust solutions of uncertain linear programs | |
Robust solutions to conic quadratic problems and their applications | |
Robust Stochastic Approximation Approach to Stochastic Programming | |
Robust Truss Topology Design via Semidefinite Programming | |
Selected topics in robust convex optimization | |
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets | |
Several NP-hard problems arising in robust stability analysis | |
Slozhnost zadach i éffektivnost metodov optimizat︠s︡ii. | |
Složnost' zadač i effektivnost' metodov optimizacii | |
Solving variational inequalities with monotone operators on domains given by Linear Minimization Oracles | |
Sparse non Gaussian component analysis by semidefinite programming | |
Statistical inference via convex optimization | |
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints | |
Validation analysis of mirror descent stochastic approximation method | |
Verifiable conditions of ℓ 1-recovery for sparse signals with sign restrictions | |
Сложность задач и эффективность методов оптимизации |