default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArkadi Nemirovski
Arkadii Nemirovskii – Arkadi S. Nemirovsky – A. S. Nemirovskii 0001
Person information
- affiliation: Georgia Institute of Technology, Atlanta, USA
- award (2003): John von Neumann Theory Prize
- award (1982): Fulkerson Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j81]Anatoli B. Juditsky
, Arkadi Nemirovski:
On Design of Polyhedral Estimates in Linear Inverse Problems. SIAM J. Math. Data Sci. 6(1): 76-96 (2024)- 2023
- [i6]Anatoli B. Juditsky, Arkadi Nemirovski, Yao Xie, Chen Xu:
Generalized generalized linear models: Convex estimation and online bounds. CoRR abs/2304.13793 (2023) - 2022
- [j80]Anatoli B. Juditsky, Georgios Kotsalis, Arkadi Nemirovski:
Tight computationally efficient approximation of matrix norms with applications. Open J. Math. Optim. 3: 1-38 (2022) - [j79]Anatoli B. Juditsky, Arkadi Nemirovski:
On well-structured convex-concave saddle point problems and variational inequalities with monotone operators. Optim. Methods Softw. 37(5): 1567-1602 (2022) - 2021
- [j78]Vincent Guigues, Anatoli B. Juditsky, Arkadi Nemirovski:
Constant Depth Decision Rules for multistage optimization under uncertainty. Eur. J. Oper. Res. 295(1): 223-232 (2021) - [j77]Georgios Kotsalis, Guanghui Lan, Arkadi S. Nemirovsky:
Convex Optimization for Finite-Horizon Robust Covariance Control of Linear Stochastic Systems. SIAM J. Control. Optim. 59(1): 296-319 (2021) - 2020
- [j76]Anatoli B. Juditsky, Arkadi Nemirovski, Liyan Xie, Yao Xie:
Convex Parameter Recovery for Interacting Marked Processes. IEEE J. Sel. Areas Inf. Theory 1(3): 799-813 (2020) - [i5]Anatoli B. Juditsky, Arkadi Nemirovski, Liyan Xie, Yao Xie:
Convex Recovery of Marked Spatio-Temporal Point Processes. CoRR abs/2003.12935 (2020)
2010 – 2019
- 2019
- [j75]Alexander V. Nazin, Arkadi S. Nemirovsky, Alexandre B. Tsybakov, Anatoli B. Juditsky:
Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method. Autom. Remote. Control. 80(9): 1607-1627 (2019) - [j74]Anatoli B. Juditsky, Arkadi S. Nemirovsky:
Signal Recovery by Stochastic Optimization. Autom. Remote. Control. 80(10): 1878-1893 (2019) - 2017
- [j73]Bruce Cox, Anatoli B. Juditsky, Arkadi Nemirovski:
Decomposition Techniques for Bilinear Saddle Point Problems and Variational Inequalities with Affine Monotone Operators. J. Optim. Theory Appl. 172(2): 402-435 (2017) - [j72]Vincent Guigues, Anatoli B. Juditsky, Arkadi Nemirovski:
Non-asymptotic confidence bounds for the optimal value of a stochastic program. Optim. Methods Softw. 32(5): 1033-1058 (2017) - 2016
- [j71]Anatoli B. Juditsky, Arkadi Nemirovski:
Solving variational inequalities with monotone operators on domains given by Linear Minimization Oracles. Math. Program. 156(1-2): 221-256 (2016) - [c6]Dmitry Ostrovsky, Zaïd Harchaoui, Anatoli B. Juditsky, Arkadi Nemirovski:
Structure-Blind Signal Recovery. NIPS 2016: 4817-4825 - 2015
- [j70]Anatoli B. Juditsky, A. S. Nemirovskii:
On sequential hypotheses testing via convex optimization. Autom. Remote. Control. 76(5): 809-825 (2015) - [j69]Yurii E. Nesterov, Arkadi Nemirovski:
Finding the stationary states of Markov chains by iterative methods. Appl. Math. Comput. 255: 58-65 (2015) - [j68]Niao He, Anatoli B. Juditsky, Arkadi Nemirovski:
Mirror Prox algorithm for multi-term composite minimization and semi-separable problems. Comput. Optim. Appl. 61(2): 275-319 (2015) - [j67]Cristóbal Guzmán, Arkadi Nemirovski:
On lower complexity bounds for large-scale smooth convex optimization. J. Complex. 31(1): 1-14 (2015) - [j66]Aharon Ben-Tal, Arkadi Nemirovski:
On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms. Math. Oper. Res. 40(2): 474-494 (2015) - [j65]Zaïd Harchaoui, Anatoli B. Juditsky, Arkadi Nemirovski:
Conditional gradient algorithms for norm-regularized smooth convex optimization. Math. Program. 152(1-2): 75-112 (2015) - [c5]Zaïd Harchaoui, Anatoli B. Juditsky, Arkadi Nemirovski, Dmitry Ostrovsky:
Adaptive Recovery of Signals by Convex Optimization. COLT 2015: 929-955 - 2014
- [j64]A. P. Goryashko, A. S. Nemirovskii:
Robust energy cost optimization of water distribution system with uncertain demand. Autom. Remote. Control. 75(10): 1754-1769 (2014) - [j63]Bruce Cox, Anatoli B. Juditsky, Arkadi Nemirovski:
Dual subgradient algorithms for large-scale nonsmooth learning problems. Math. Program. 148(1-2): 143-180 (2014) - 2013
- [j62]Yurii E. Nesterov, Arkadi Nemirovski:
On first-order algorithms for l1/nuclear norm minimization. Acta Numer. 22: 509-575 (2013) - [j61]Elmar Diederichs, Anatoli B. Juditsky, Arkadi Nemirovski, Vladimir G. Spokoiny:
Sparse non Gaussian component analysis by semidefinite programming. Mach. Learn. 91(2): 211-238 (2013) - [j60]Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski:
Randomized first order algorithms with applications to ℓ 1-minimization. Math. Program. 142(1-2): 269-310 (2013) - [j59]Michel Baes, Michael Bürgisser, Arkadi Nemirovski:
A Randomized Mirror-Prox Method for Solving Structured Large-Scale Matrix Saddle-Point Problems. SIAM J. Optim. 23(2): 934-962 (2013) - [i4]Cristóbal Guzmán, Arkadi Nemirovski:
On Lower Complexity Bounds for Large-Scale Smooth Convex Optimization. CoRR abs/1307.5001 (2013) - [i3]Niao He, Anatoli B. Juditsky, Arkadi Nemirovski:
Mirror Prox Algorithm for Multi-Term Composite Minimization and Alternating Directions. CoRR abs/1311.1098 (2013) - 2012
- [j58]Arkadi Nemirovski:
On safe tractable approximations of chance constraints. Eur. J. Oper. Res. 219(3): 707-718 (2012) - [j57]Aharon Ben-Tal, Sahely Bhadra, Chiranjib Bhattacharyya, Arkadi Nemirovski:
Efficient methods for robust classification under uncertainty in kernel matrices. J. Mach. Learn. Res. 13: 2923-2954 (2012) - [j56]Guanghui Lan, Arkadi Nemirovski, Alexander Shapiro:
Validation analysis of mirror descent stochastic approximation method. Math. Program. 134(2): 425-458 (2012) - [i2]Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski:
On unified view of nullspace-type conditions for recoveries associated with general sparsity structures. CoRR abs/1207.1119 (2012) - [i1]Aharon Ben-Tal, Arkadi Nemirovski:
Solving large scale polynomial convex problems on ℓ1/nuclear norm balls by randomized first-order algorithms. CoRR abs/1210.6853 (2012) - 2011
- [j55]Anatoli B. Juditsky, Arkadi Nemirovski:
On verifiable sufficient conditions for sparse signal recovery via ℓ1 minimization. Math. Program. 127(1): 57-88 (2011) - [j54]Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski:
Verifiable conditions of ℓ1-recovery for sparse signals with sign restrictions. Math. Program. 127(1): 89-122 (2011) - [j53]Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski:
On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing. SIAM J. Matrix Anal. Appl. 32(3): 1019-1029 (2011) - [j52]Anatoli B. Juditsky, Arkadi Nemirovski:
Accuracy Guarantees for ℓ1-Recovery. IEEE Trans. Inf. Theory 57(12): 7818-7839 (2011) - [c4]Anatoli Iouditski, Fatma Kilinç-Karzan, Arkadi Nemirovski, Boris T. Polyak:
On the accuracy of l1-filtering of signals with block-sparse structure. NIPS 2011: 1260-1268 - 2010
- [j51]Sanjoy K. Mitter, Arkadi Nemirovski, Jan C. Willems:
Discussion on: "Why Is Resorting to Fate Wise? A Critical Look at Randomized Algorithms in Systems and Control". Eur. J. Control 16(5): 431-432 (2010) - [j50]Levent Tunçel, Arkadi Nemirovski:
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets. Found. Comput. Math. 10(5): 485-525 (2010) - [j49]Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum:
Accuracy Certificates for Computational Problems with Convex Structure. Math. Oper. Res. 35(1): 52-78 (2010)
2000 – 2009
- 2009
- [b3]Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski:
Robust Optimization. Princeton Series in Applied Mathematics 28, Princeton University Press 2009, ISBN 978-1-4008-3105-0, pp. 1-542 - [j48]Aharon Ben-Tal, Arkadi Nemirovski:
On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities. Math. Oper. Res. 34(1): 1-25 (2009) - [j47]Boris S. Mordukhovich, Arkadi Nemirovski, Yurii E. Nesterov:
Foreword: special issue on nonsmooth optimization and applications. Math. Program. 120(1): 1-2 (2009) - [j46]Arkadi Nemirovski, Anatoli B. Juditsky, Guanghui Lan, Alexander Shapiro:
Robust Stochastic Approximation Approach to Stochastic Programming. SIAM J. Optim. 19(4): 1574-1609 (2009) - [r2]Arkadi Nemirovski, Kees Roos:
Motzkin Transposition Theorem. Encyclopedia of Optimization 2009: 2345-2348 - [r1]Aharon Ben-Tal, Arkadi Nemirovski, Jochem Zowe:
Semidefinite Programming and Structural Optimization. Encyclopedia of Optimization 2009: 3390-3396 - 2008
- [j45]Yurii E. Nesterov, Arkadi Nemirovski:
Primal Central Paths and Riemannian Distances for Convex Sets. Found. Comput. Math. 8(5): 533-560 (2008) - [j44]Aharon Ben-Tal, Arkadi Nemirovski:
Selected topics in robust convex optimization. Math. Program. 112(1): 125-158 (2008) - 2007
- [j43]Shmuel Gal, Michael Landsberger, Arkadi Nemirovski:
Participation in auctions. Games Econ. Behav. 60(1): 75-103 (2007) - [j42]Zhaosong Lu, Arkadi Nemirovski, Renato D. C. Monteiro:
Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm. Math. Program. 109(2-3): 211-237 (2007) - [j41]Arkadi Nemirovski:
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints. Math. Program. 109(2-3): 283-317 (2007) - 2006
- [j40]Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski:
Foreword: special issue on robust optimization. Math. Program. 107(1-2): 1-3 (2006) - [j39]Aharon Ben-Tal, Stephen P. Boyd, Arkadi Nemirovski:
Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems. Math. Program. 107(1-2): 63-89 (2006) - [j38]Arkadi Nemirovski, Alexander Shapiro:
Convex Approximations of Chance Constrained Programs. SIAM J. Optim. 17(4): 969-996 (2006) - 2005
- [j37]Arkadi Nemirovski, Levent Tunçel:
"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods. Math. Program. 102(2): 261-294 (2005) - [j36]Aharon Ben-Tal, Arkadi Nemirovski:
Non-euclidean restricted memory level method for large-scale convex optimization. Math. Program. 102(3): 407-456 (2005) - [j35]Aharon Ben-Tal, Boaz Golany, Arkadi Nemirovski, Jean-Philippe Vial:
Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach. Manuf. Serv. Oper. Manag. 7(3): 248-271 (2005) - [j34]Yonina C. Eldar, Aharon Ben-Tal, Arkadi Nemirovski:
Robust mean-squared error estimation in the presence of model uncertainties. IEEE Trans. Signal Process. 53(1): 168-181 (2005) - 2004
- [j33]Aharon Ben-Tal, A. P. Goryashko, E. Guslitzer, Arkadi Nemirovski:
Adjustable robust solutions of uncertain linear programs. Math. Program. 99(2): 351-376 (2004) - [j32]Arkadi Nemirovski:
Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems. SIAM J. Optim. 15(1): 229-251 (2004) - [j31]Yonina C. Eldar, Aharon Ben-Tal, Arkadi Nemirovski:
Linear minimax regret estimation of deterministic parameters with bounded data uncertainties. IEEE Trans. Signal Process. 52(8): 2177-2188 (2004) - [c3]Yonina C. Eldar, Aharon Ben-Tal, Arkadi Nemirovski:
Minimax regret estimation in linear models. ICASSP (2) 2004: 161-164 - 2003
- [j30]Aharon Ben-Tal, Arkadi Nemirovski, Cornelis Roos:
Extended Matrix Cube Theorems with Applications to µ-Theory in Control. Math. Oper. Res. 28(3): 497-523 (2003) - [j29]Florin Dan Barb, Aharon Ben-Tal, Arkadi Nemirovski:
Robust Dissipativity of Interval Uncertain Linear Systems. SIAM J. Control. Optim. 41(6): 1661-1695 (2003) - [j28]Arie Feuer, Arkadi Nemirovski:
On sparse representation in pairs of bases. IEEE Trans. Inf. Theory 49(6): 1579-1581 (2003) - [c2]Arkadi Nemirovski:
On tractable approximations of randomly perturbed convex constraints. CDC 2003: 2419-2422 - 2002
- [j27]Aharon Ben-Tal, Arkadi Nemirovski:
Robust optimization - methodology and applications. Math. Program. 92(3): 453-480 (2002) - [j26]Aharon Ben-Tal, Arkadi Nemirovski:
On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty. SIAM J. Optim. 12(3): 811-833 (2002) - [j25]Aharon Ben-Tal, Arkadi Nemirovski, Cees Roos:
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems. SIAM J. Optim. 13(2): 535-560 (2002) - 2001
- [b2]Aharon Ben-Tal, Arkadii Nemirovskii:
Lectures on modern convex optimization - analysis, algorithms, and engineering applications. MPS-SIAM series on optimization, SIAM 2001, ISBN 978-0-89871-491-3, pp. I-XVI, 1-488 - [j24]Aharon Ben-Tal, Arkadi Nemirovski:
On Polyhedral Approximations of the Second-Order Cone. Math. Oper. Res. 26(2): 193-205 (2001) - [j23]Aharon Ben-Tal, Tamar Margalit, Arkadi Nemirovski:
The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography. SIAM J. Optim. 12(1): 79-108 (2001) - [j22]Ron Lekkvkovitz, Dmitry Falikman, Michael Zibulevsky, Aharon Ben-Tal, Arkadi Nemirovski:
The Design and Implementation of COSEM, an Iterative Algorithm for Fully 3D Listmode Data. IEEE Trans. Medical Imaging 20(7): 633-642 (2001) - [c1]Aharon Ben-Tal, Arkadi Nemirovski:
On Approximate Robust Counterparts of Uncertain Semidefinite and Conic Quadratic Programs. System Modelling and Optimization 2001: 1-22 - 2000
- [j21]Aharon Ben-Tal, Arkadi Nemirovski:
Robust solutions of Linear Programming problems contaminated with uncertain data. Math. Program. 88(3): 411-424 (2000) - [j20]Aharon Ben-Tal, Michal Kocvara, Arkadi Nemirovski, Jochem Zowe:
Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions. SIAM Rev. 42(4): 695-715 (2000)
1990 – 1999
- 1999
- [j19]Arkadi Nemirovski, Cornelis Roos, Tamás Terlaky:
On maximization of quadratic form over intersection of ellipsoids with common center. Math. Program. 86(3): 463-473 (1999) - [j18]Aharon Ben-Tal, Arkadi Nemirovski:
Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1): 1-13 (1999) - [j17]Aharon Ben-Tal, Michal Kocvara, Arkadi Nemirovski, Jochem Zowe:
Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions. SIAM J. Optim. 9(4): 813-832 (1999) - 1998
- [j16]Yurii E. Nesterov, Arkadi Nemirovski:
Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods. Math. Oper. Res. 23(1): 1-38 (1998) - [j15]Aharon Ben-Tal, Arkadi Nemirovski:
Robust Convex Optimization. Math. Oper. Res. 23(4): 769-805 (1998) - 1997
- [j14]Pascal Gahinet, Arkadi Nemirovski:
The Projective Method for solving linear matrix inequalities. Math. Program. 77: 163-190 (1997) - [j13]Arkadi Nemirovski:
The long-step method of analytic centers for fractional problems. Math. Program. 77: 191-224 (1997) - [j12]Aharon Ben-Tal, Arkadi Nemirovski:
Robust Truss Topology Design via Semidefinite Programming. SIAM J. Optim. 7(4): 991-1016 (1997) - [j11]Alexander Goldenshluger, Arkadi Nemirovski:
Adaptive de-noising of signals satisfying differential inequalities. IEEE Trans. Inf. Theory 43(3): 872-889 (1997) - 1996
- [j10]Arkadii Nemirovskii, Katya Scheinberg:
Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems. Math. Program. 72: 273-289 (1996) - [j9]Arkadi Nemirovski:
On polynomiality of the method of analyitc centers for fractional problems. Math. Program. 73: 175-198 (1996) - 1995
- [j8]Claude Lemaréchal, Arkadii Nemirovskii, Yurii E. Nesterov:
New variants of bundle methods. Math. Program. 69: 111-147 (1995) - [j7]Yurii E. Nesterov, A. S. Nemirovskii:
An interior-point method for generalized linear-fractional programming. Math. Program. 69: 177-204 (1995) - 1994
- [b1]Yurii E. Nesterov, Arkadii Nemirovskii:
Interior-point polynomial algorithms in convex programming. Siam studies in applied mathematics 13, SIAM 1994, ISBN 978-0-89871-319-0, pp. I-VII, 1-405 - [j6]Arkadi Nemirovski:
On Parallel Complexity of Nonsmooth Convex Optimization. J. Complex. 10(4): 451-463 (1994) - [j5]Aharon Ben-Tal, Arkadii Nemirovskii:
Potential Reduction Polynomial Time Method for Truss Topology Design. SIAM J. Optim. 4(3): 596-612 (1994) - 1993
- [j4]Arkadii Nemirovskii:
Several NP-hard problems arising in robust stability analysis. Math. Control. Signals Syst. 6(2): 99-105 (1993) - 1992
- [j3]Arkadi S. Nemirovsky:
Information-based complexity of linear operator equations. J. Complex. 8(2): 153-175 (1992) - 1991
- [j2]Arkadi S. Nemirovsky:
On optimality of Krylov's information when solving linear operator equations. J. Complex. 7(2): 121-130 (1991) - [j1]Yurii E. Nesterov, Arkadii Nemirovskii:
Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem. SIAM J. Optim. 1(4): 548-564 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
