SIAM Journal on Optimization

Title Publication Date Language Citations
A Singular Value Thresholding Algorithm for Matrix Completion2010/01/01English2,864
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds1996/05/01English1,980
On the Implementation of a Primal-Dual Interior Point Method1992/11/01English788
Mesh Adaptive Direct Search Algorithms for Constrained Optimization2006/01/01English672
Robust Stochastic Approximation Approach to Stochastic Programming2009/01/01English670
A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search2005/01/01English661
Convex Approximations of Chance Constrained Programs2007/01/01English616
Global Convergence Properties of Conjugate Gradient Methods for Optimization1992/02/01English584
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization2013/01/01English582
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence2008/01/01English477
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems2012/01/01English416
Rank-Sparsity Incoherence for Matrix Decomposition2011/04/01English412
Cones of Matrices and Set-Functions and 0–1 Optimization1991/05/01English400
Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems2016/01/01English385
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization1995/02/01English378
The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems2007/01/01English369
A Sample Approximation Approach for Optimization with Probabilistic Constraints2008/01/01English361
An Interior-Point Method for Semidefinite Programming1996/05/01English351
Benchmarking Derivative-Free Optimization Algorithms2009/01/01English318
Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming2013/01/01English293
Globally Convergent Inexact Newton Methods1994/05/01English278
Problem Formulation for Multidisciplinary Optimization1994/11/01English267
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations2011/01/01English261
A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results1992/02/01English250
On Augmented Lagrangian Methods with General Lower-Level Constraints2008/01/01English241
On the Complexity of Nonnegative Matrix Factorization2010/01/01English238
On the Convergence of Block Coordinate Descent Type Methods2013/01/01English237
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization2005/01/01English237
Variable Metric Method for Minimization1991/02/01English234
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions1993/08/01English225