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
Newton's Method for Large Bound-Constrained Optimization Problems1999
Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets1999
An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems1998
An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming1998
Approximation Schemes for Infinite Linear Programs1998
BFGS with Update Skipping and Varying Memory1998
Interior Point Trajectories in Semidefinite Programming1998
On Extending Some Primal-Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming1998
Robust Solutions to Uncertain Semidefinite Programs1998
Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming1998
Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts1997
The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms1997
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems1996
The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method1996
A Reduced Hessian Method for Large-Scale Constrained Optimization1995
Existence and Regularity of Solutions to a Variational Problem of Mumford and Shah: A Constructive Approach1995
A Path-Following Projective Interior Point Method for Linear Programming1994
Extension of Hoffman's Error Bound to Polynomial Systems1994
On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem1994
Serial and Parallel Multicategory Discrimination1994
A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming1993
Convex Functions with Unbounded Level Sets and Applications to Duality Theory1993
Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set1993
On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems1993
Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization1993
An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization1992
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem1992
On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms1992
A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming1991

« prev Page 13/13