Arkadi Nemirovski
Orcid: 0000-0002-5001-7420Affiliations:
- Georgia Institute of Technology, Atlanta, USA
According to our database1,
Arkadi Nemirovski
authored at least 96 papers
between 1991 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on viaf.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
On csauthors.net:
Bibliography
2024
SIAM J. Math. Data Sci., March, 2024
2023
CoRR, 2023
2022
Open J. Math. Optim., March, 2022
On well-structured convex-concave saddle point problems and variational inequalities with monotone operators.
Optim. Methods Softw., 2022
2021
Convex Optimization for Finite-Horizon Robust Covariance Control of Linear Stochastic Systems.
SIAM J. Control. Optim., 2021
Eur. J. Oper. Res., 2021
2020
IEEE J. Sel. Areas Inf. Theory, 2020
2019
Autom. Remote. Control., 2019
2017
Optim. Methods Softw., 2017
Decomposition Techniques for Bilinear Saddle Point Problems and Variational Inequalities with Affine Monotone Operators.
J. Optim. Theory Appl., 2017
2016
Solving variational inequalities with monotone operators on domains given by Linear Minimization Oracles.
Math. Program., 2016
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
2015
Math. Program., 2015
On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms.
Math. Oper. Res., 2015
J. Complex., 2015
Mirror Prox algorithm for multi-term composite minimization and semi-separable problems.
Comput. Optim. Appl., 2015
Appl. Math. Comput., 2015
Autom. Remote. Control., 2015
Proceedings of The 28th Conference on Learning Theory, 2015
2014
Math. Program., 2014
Autom. Remote. Control., 2014
2013
A Randomized Mirror-Prox Method for Solving Structured Large-Scale Matrix Saddle-Point Problems.
SIAM J. Optim., 2013
Math. Program., 2013
Mach. Learn., 2013
Mirror Prox Algorithm for Multi-Term Composite Minimization and Alternating Directions.
CoRR, 2013
2012
Math. Program., 2012
J. Mach. Learn. Res., 2012
Solving large scale polynomial convex problems on ℓ<sub>1</sub>/nuclear norm balls by randomized first-order algorithms
CoRR, 2012
On unified view of nullspace-type conditions for recoveries associated with general sparsity structures
CoRR, 2012
2011
On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing.
SIAM J. Matrix Anal. Appl., 2011
On verifiable sufficient conditions for sparse signal recovery via <i>ℓ</i><sub>1</sub> minimization.
Math. Program., 2011
Verifiable conditions of <i>ℓ</i><sub>1</sub>-recovery for sparse signals with sign restrictions.
Math. Program., 2011
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011
2010
Math. Oper. Res., 2010
Found. Comput. Math., 2010
Discussion on: "Why Is Resorting to Fate Wise? A Critical Look at Randomized Algorithms in Systems and Control".
Eur. J. Control, 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
SIAM J. Optim., 2009
Math. Program., 2009
Math. Oper. Res., 2009
Princeton Series in Applied Mathematics 28, Princeton University Press, ISBN: 978-1-4008-3105-0, 2009
2008
Found. Comput. Math., 2008
2007
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints.
Math. Program., 2007
Math. Program., 2007
2006
Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems.
Math. Program., 2006
2005
IEEE Trans. Signal Process., 2005
Manuf. Serv. Oper. Manag., 2005
"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods.
Math. Program., 2005
Math. Program., 2005
2004
Linear minimax regret estimation of deterministic parameters with bounded data uncertainties.
IEEE Trans. Signal Process., 2004
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., 2004
Proceedings of the 2004 IEEE International Conference on Acoustics, 2004
2003
SIAM J. Control. Optim., 2003
Math. Oper. Res., 2003
Proceedings of the 42nd IEEE Conference on Decision and Control, 2003
2002
SIAM J. Optim., 2002
On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty.
SIAM J. Optim., 2002
2001
The Design and Implementation of COSEM, an Iterative Algorithm for Fully 3D Listmode Data.
IEEE Trans. Medical Imaging, 2001
The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography.
SIAM J. Optim., 2001
On Approximate Robust Counterparts of Uncertain Semidefinite and Conic Quadratic Programs.
Proceedings of the System Modelling and Optimization XX, 2001
Lectures on modern convex optimization - analysis, algorithms, and engineering applications.
MPS-SIAM series on optimization, SIAM, ISBN: 978-0-89871-491-3, 2001
2000
Math. Program., 2000
1999
Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions.
SIAM J. Optim., 1999
On maximization of quadratic form over intersection of ellipsoids with common center.
Math. Program., 1999
1998
Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods.
Math. Oper. Res., 1998
1997
IEEE Trans. Inf. Theory, 1997
Math. Program., 1997
1996
Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems.
Math. Program., 1996
Math. Program., 1996
1995
Math. Program., 1995
1994
SIAM J. Optim., 1994
Siam studies in applied mathematics 13, SIAM, ISBN: 978-0-89871-319-0, 1994
1993
Math. Control. Signals Syst., 1993
1992
1991
Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem.
SIAM J. Optim., 1991
J. Complex., 1991