Arkadi Nemirovski

According to our database1, Arkadi Nemirovski authored at least 88 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Convex Recovery of Marked Spatio-Temporal Point Processes.
CoRR, 2020

2019
Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method.
Autom. Remote. Control., 2019

Signal Recovery by Stochastic Optimization.
Autom. Remote. Control., 2019

2017
Non-asymptotic confidence bounds for the optimal value of a stochastic program.
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

Structure-Blind Signal Recovery.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Conditional gradient algorithms for norm-regularized smooth convex optimization.
Math. Program., 2015

On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms.
Math. Oper. Res., 2015

On lower complexity bounds for large-scale smooth convex optimization.
J. Complex., 2015

Mirror Prox algorithm for multi-term composite minimization and semi-separable problems.
Comput. Optim. Appl., 2015

Finding the stationary states of Markov chains by iterative methods.
Appl. Math. Comput., 2015

On sequential hypotheses testing via convex optimization.
Autom. Remote. Control., 2015

Adaptive Recovery of Signals by Convex Optimization.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Dual subgradient algorithms for large-scale nonsmooth learning problems.
Math. Program., 2014

Robust energy cost optimization of water distribution system with uncertain demand.
Autom. Remote. Control., 2014

2013
A Randomized Mirror-Prox Method for Solving Structured Large-Scale Matrix Saddle-Point Problems.
SIAM J. Optim., 2013

Randomized first order algorithms with applications to ℓ 1-minimization.
Math. Program., 2013

Sparse non Gaussian component analysis by semidefinite programming.
Mach. Learn., 2013

Mirror Prox Algorithm for Multi-Term Composite Minimization and Alternating Directions.
CoRR, 2013

On first-order algorithms for l1/nuclear norm minimization.
Acta Numer., 2013

2012
Validation analysis of mirror descent stochastic approximation method.
Math. Program., 2012

Efficient methods for robust classification under uncertainty in kernel matrices.
J. Mach. Learn. Res., 2012

On safe tractable approximations of chance constraints.
Eur. J. Oper. 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
Accuracy Guarantees for ℓ<sub>1</sub>-Recovery.
IEEE Trans. Inf. Theory, 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

On the accuracy of l1-filtering of signals with block-sparse structure.
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
Accuracy Certificates for Computational Problems with Convex Structure.
Math. Oper. Res., 2010

Self-Concordant Barriers for Convex Approximations of Structured Convex Sets.
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
Motzkin Transposition Theorem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Semidefinite Programming and Structural Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Robust Stochastic Approximation Approach to Stochastic Programming.
SIAM J. Optim., 2009

Foreword: special issue on nonsmooth optimization and applications.
Math. Program., 2009

On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities.
Math. Oper. Res., 2009

Robust Optimization
Princeton Series in Applied Mathematics 28, Princeton University Press, ISBN: 978-1-4008-3105-0, 2009

2008
Selected topics in robust convex optimization.
Math. Program., 2008

Primal Central Paths and Riemannian Distances for Convex Sets.
Found. Comput. Math., 2008

2007
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints.
Math. Program., 2007

Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm.
Math. Program., 2007

Participation in auctions.
Games Econ. Behav., 2007

2006
Convex Approximations of Chance Constrained Programs.
SIAM J. Optim., 2006

Foreword: special issue on robust optimization.
Math. Program., 2006

Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems.
Math. Program., 2006

2005
Robust mean-squared error estimation in the presence of model uncertainties.
IEEE Trans. Signal Process., 2005

Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach.
Manuf. Serv. Oper. Manag., 2005

"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods.
Math. Program., 2005

Non-euclidean restricted memory level method for large-scale convex optimization.
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

Adjustable robust solutions of uncertain linear programs.
Math. Program., 2004

Minimax regret estimation in linear models.
Proceedings of the 2004 IEEE International Conference on Acoustics, 2004

2003
On sparse representation in pairs of bases.
IEEE Trans. Inf. Theory, 2003

Robust Dissipativity of Interval Uncertain Linear Systems.
SIAM J. Control. Optim., 2003

Extended Matrix Cube Theorems with Applications to µ-Theory in Control.
Math. Oper. Res., 2003

2002
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems.
SIAM J. Optim., 2002

On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty.
SIAM J. Optim., 2002

Robust optimization - methodology and applications.
Math. Program., 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 Polyhedral Approximations of the Second-Order Cone.
Math. Oper. Res., 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
Robust solutions of Linear Programming problems contaminated with uncertain data.
Math. Program., 2000

1999
Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions.
SIAM J. Optim., 1999

Robust solutions of uncertain linear programs.
Oper. Res. Lett., 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

Robust Convex Optimization.
Math. Oper. Res., 1998

1997
Adaptive de-noising of signals satisfying differential inequalities.
IEEE Trans. Inf. Theory, 1997

Robust Truss Topology Design via Semidefinite Programming.
SIAM J. Optim., 1997

The long-step method of analytic centers for fractional problems.
Math. Program., 1997

The Projective Method for solving linear matrix inequalities.
Math. Program., 1997

1996
Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems.
Math. Program., 1996

On polynomiality of the method of analyitc centers for fractional problems.
Math. Program., 1996

1995
An interior-point method for generalized linear-fractional programming.
Math. Program., 1995

New variants of bundle methods.
Math. Program., 1995

1994
Potential Reduction Polynomial Time Method for Truss Topology Design.
SIAM J. Optim., 1994

On Parallel Complexity of Nonsmooth Convex Optimization.
J. Complex., 1994

Interior-point polynomial algorithms in convex programming.
Siam studies in applied mathematics 13, SIAM, ISBN: 978-0-89871-319-0, 1994

1993
Several NP-hard problems arising in robust stability analysis.
Math. Control. Signals Syst., 1993

1992
Information-based complexity of linear operator equations.
J. Complex., 1992

1991
Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem.
SIAM J. Optim., 1991

On optimality of Krylov's information when solving linear operator equations.
J. Complex., 1991


  Loading...