SIAM J. Optim

629 papers425 directions

Papers by Year

2026 12
2025 29
2024 56
2023 59
2022 60
2021 53
2020 62
2019 51
2018 58
2017 36
2016 28
2015 31
2014 22
2013 26
2012 19
2011 16
2010 12
2009 13
2008 11
2007 6
2006 9
2005 11
2004 3
2003 2
2002 6
2001 3
1999 2
1998 8
1997 2
1996 2
1995 2
1994 4
1993 5
1992 3
1991 1

Top Research Directions

Research directions most represented by papers from this venue.

Overcoming the Convexity Constraint in Modern Optimization 43
Convergence Guarantees for Inexact Subproblem Optimization 30
Optimization over Non-Smooth and Non-Convex Landscapes 16
Parameter Agnostic Optimization for Unknown Problem Constants 15
Semidefinite Relaxation for Non-Convex Engineering Optimization 14
Geometry Aware Optimization via Relative Smoothness 12
Optimization Beyond Global Lipschitz Continuity 12
Semismooth Newton Methods for Nonsmooth Optimization 11
Adaptive Parameter Selection for Algorithmic Robustness 10
The Moment-Sum-of-Squares Hierarchy 9
Optimization Under Stochastic Evaluation Noise 9
The Empirical Validation Gap 9
Constrained Online Optimization Beyond Slater Conditions 8
Stochastic Optimization in Unbounded Domains 8
Extending Optimization Frameworks to Multi Objective Problems 8

Top Authors

AuthorPapers
Jean B. Lasserre20
Pablo Parrilo13
Santanu Dey12
Shuzhong Zhang11
Francesco Rinaldi10
Anthony Man-Cho So8
Donald Goldfarb8
Pierre-Antoine Absil8
Serge Gratton8
Angelia Nedich7
Francis Bach7
Mingyi Hong7
Uday Shanbhag7
Victor Magron7
Xiaoming Yuan7
Zhi-Quan Luo7
Aryan Mokhtari6
Charles Dossal6
Jerome Bolte6
Jerome Malick6

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
A First-Order Convergence Analysis of Trust-Region Methods with Inexact Jacobians2008
A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance2008
Branch-and-Cut for the Maximum Feasible Subsystem Problem2008
Fixed-Point Continuation for l1-Minimization: Methodology and Convergence2008
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization2008
On the Global Solution of Linear Programs with Linear Complementarity Constraints2008
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization2008
Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization2008
Smooth Optimization with Approximate Gradient2008
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials2008
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs2008
A Convergent Incremental Gradient Method with a Constant Step Size2007
Approximate Gauss-Newton Methods for Nonlinear Least Squares Problems2007
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints2007
Clarke Subgradients of Stratifiable Functions2007
On the Regularization of Sliding Modes2007
The [barred L]ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems2007
An Active Set Method for Single-Cone Second-Order Cone Programs2006
An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming2006
A Sum of Squares Approximation of Nonnegative Polynomials2006
Calmness and Error Bounds for Convex Constraint Systems2006
Constraint Reduction for Linear Programs with Many Inequality Constraints2006
Convergent SDP-Relaxations in Polynomial Optimization with Sparsity2006
Enhanced Fritz John Conditions for Convex Programming2006
Solving Second Order Cone Programming via a Reduced Augmented System Approach2006
Stationarity Results for Generating Set Search for Linearly Constrained Optimization2006
An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)2005
A Note on the Local Convergence of a Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Based on the Alizadeh--Haeberly--Overton Search Direction2005
Convergence of the Iterates of Descent Methods for Analytic Cost Functions2005
Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/22005
Line Search Filter Methods for Nonlinear Programming: Local Convergence2005
Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence2005
Polynomial Programming: LP-Relaxations Also Converge2005
Probabilistically Constrained Linear Programs and Risk-Adjusted Controller Design2005
Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization2005
Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set2005
Multivariate Nonnegative Quadratic Mappings2004
New Preconditioners for KKT Systems of Network Flow Problems2004
On the Convergence of Asynchronous Parallel Pattern Search2004
A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization2003
On Numerical Solution of the Maximum Volume Ellipsoid Problem2003
A Complementary Pivoting Approach to the Maximum Weight Clique Problem2002
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs2002
Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm2002
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs2002
Robust Filtering via Semidefinite Programming with Applications to Target Tracking2002
Smoothing Functions for Second-Order-Cone Complementarity Problems2002
Approximating the Single-Sink Link-Installation Problem in Network Design2001
Global Optimization with Polynomials and the Problem of Moments2001
Incremental Subgradient Methods for Nondifferentiable Optimization2001

« prev Page 12/13 next »