SIAM Journal on Optimization

Title Publication Date Language Citations
Nonsmooth Equations: Motivation and Algorithms1993/08/01English224
Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming2012/01/01English223
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity2006/01/01English218
On the Convergence of Decentralized Gradient Descent2016/01/01English215
Low-Rank Matrix Completion by Riemannian Optimization2013/01/01English212
Clarke Subgradients of Stratifiable Functions2007/01/01English210
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming2010/01/01English205
Global Convergence of Splitting Methods for Nonconvex Composite Optimization2015/01/01English201
A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search2013/01/01English201
A Proximal Stochastic Gradient Method with Progressive Variance Reduction2014/01/01English191
On the Solution of Large Quadratic Programming Problems with Bound Constraints1991/02/01English178
On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem1994/02/01English166
A Stochastic Quasi-Newton Method for Large-Scale Optimization2016/01/01English161
Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods2009/01/01English155
Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms2013/01/01English154
A New Active Set Algorithm for Box Constrained Optimization2006/01/01English151
On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming1992/08/01English149
Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization2013/01/01English143
Projection-like Retractions on Matrix Manifolds2012/01/01English143
Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints2006/01/01English142
Strong Convergence Theorem by a Hybrid Method for Nonexpansive Mappings and Lipschitz-Continuous Monotone Mappings2006/01/01English141
Direct Search Methods on Parallel Machines1991/11/01English141
Convergence Theory of Nonlinear Newton–Krylov Algorithms1994/05/01English140
OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions2009/01/01English139
Convergence of the Iterates of Descent Methods for Analytic Cost Functions2005/01/01English138
Existence and Approximation of Fixed Points of Firmly Nonexpansive-Type Mappings in Banach Spaces2008/01/01English136
A Convergent Incremental Gradient Method with a Constant Step Size2007/01/01English129
McCormick-Based Relaxations of Algorithms2009/01/01English124
On the Convergence of the Multidirectional Search Algorithm1991/02/01English124
Random Convex Programs2010/01/01English123