SIAM Journal on Optimization

Papers
(The TQCC of SIAM Journal on Optimization is 5. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-08-01 to 2025-08-01.)
ArticleCitations
Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming48
Occupation Measure Relaxations in Variational Problems: The Role of Convexity45
An Approximation-Based Regularized Extra-Gradient Method for Monotone Variational Inequalities31
Reducing Nonnegativity over General Semialgebraic Sets to Nonnegativity over Simple Sets28
Variational Convexity of Functions and Variational Sufficiency in Optimization26
A Descent Algorithm for the Optimal Control of ReLU Neural Network Informed PDEs Based on Approximate Directional Derivatives24
Optimal Self-Concordant Barriers for Quantum Relative Entropies23
High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles21
On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials20
A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization20
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity19
Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function18
Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions18
Fenchel–Young Inequality with a Remainder and Applications to Convex Duality and Optimal Transport17
Fenchel Duality and a Separation Theorem on Hadamard Manifolds17
A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer17
Refined TSSOS17
On a Differential Generalized Nash Equilibrium Problem with Mean Field Interaction16
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints15
Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods14
The Computation of Approximate Feedback Stackelberg Equilibria in Multiplayer Nonlinear Constrained Dynamic Games14
The Rate of Convergence of Bregman Proximal Methods: Local Geometry Versus Regularity Versus Sharpness14
On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms14
Solution of Mismatched Monotone+Lipschitz Inclusion Problems14
Subgradient Sampling for Nonsmooth Nonconvex Minimization13
Harnessing Structure in Composite Nonsmooth Minimization13
Linear Programming on the Stiefel Manifold13
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems13
Optimal Convergence Rates for the Proximal Bundle Method12
The Ratio-Cut Polytope and K-Means Clustering12
Decomposition Methods for Global Solution of Mixed-Integer Linear Programs11
A Family of \(\boldsymbol{s}\)-Rectangular Robust MDPs: Relative Conservativeness, Asymptotic Analyses, and Finite-Sample Properties11
Using Taylor-Approximated Gradients to Improve the Frank–Wolfe Method for Empirical Risk Minimization11
Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation11
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs11
Convergent Algorithms for a Class of Convex Semi-infinite Programs10
Convergence Analyses of Davis–Yin Splitting via Scaled Relative Graphs10
Understanding the Influence of Digraphs on Decentralized Optimization: Effective Metrics, Lower Bound, and Optimal Algorithm10
Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part I: Convex Relaxations10
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints10
Distributionally Robust Two-Stage Stochastic Programming10
On the Complexity of Matrix Putinar’s Positivstellensätz10
On the Divergence of Decentralized Nonconvex Optimization9
A Disjunctive Cutting Plane Algorithm for Bilinear Programming9
A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems9
Scalable Frank–Wolfe on Generalized Self-Concordant Functions via Simple Steps9
Continuous Newton-like Methods Featuring Inertia and Variable Mass9
Escaping Unknown Discontinuous Regions in Blackbox Optimization9
Optimization on the Euclidean Unit Sphere9
Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems8
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients8
Mini-Batch Risk Forms8
Degenerate Preconditioned Proximal Point Algorithms8
The Stochastic Auxiliary Problem Principle in Banach Spaces: Measurability and Convergence8
Strong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) Spaces8
A Search-Free \({O(1/{k}^{3/2})}\) Homotopy Inexact Proximal-Newton Extragradient Algorithm for Monotone Variational Inequalities8
Consensus-Based Optimization Methods Converge Globally8
Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy8
First-Order Penalty Methods for Bilevel Optimization8
Dynamic Stochastic Variational Inequalities and Convergence of Discrete Approximation7
Proximity Operators of Perspective Functions with Nonlinear Scaling7
An Exact Method for Nonlinear Network Flow Interdiction Problems7
MINRES: From Negative Curvature Detection to Monotonicity Properties7
Algorithms to Solve Unbounded Convex Vector Optimization Problems7
A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees7
Piecewise Polyhedral Relaxations of Multilinear Optimization7
Fisher–Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients7
Linearly Constrained Nonsmooth Optimization for Training Autoencoders7
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems7
Minimal Pairs of Convex Sets Which Share a Recession Cone7
On Enhanced KKT Optimality Conditions for Smooth Nonlinear Optimization7
Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction6
Performance Bounds for PDE-Constrained Optimization under Uncertainty6
Square Root LASSO: Well-Posedness, Lipschitz Stability, and the Tuning Trade-Off6
A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds6
Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence6
Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation6
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective6
Parameter-Free Accelerated Gradient Descent for Nonconvex Minimization6
A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization6
Bayesian Joint Chance Constrained Optimization: Approximations and Statistical Consistency6
Subdifferentially Polynomially Bounded Functions and Gaussian Smoothing–Based Zeroth-Order Optimization6
Accelerating Preconditioned ADMM via Degenerate Proximal Point Mappings6
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search5
Constrained Consensus-Based Optimization5
Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy5
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets5
Corrigendum: Convex Optimization Problems on Differentiable Sets5
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems5
Adaptive Partitioning for Chance-Constrained Problems with Finite Support5
On Cutting Plane Algorithms for Nonlinear Binary Optimization5
An Improved Unconstrained Approach for Bilevel Optimization5
Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency5
Convergence Analysis of a Norm Minimization-Based Convex Vector Optimization Algorithm5
Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty5
Cyclic Coordinate Dual Averaging with Extrapolation5
New Methods for Parametric Optimization via Differential Equations5
Complexity of Finite-Sum Optimization with Nonsmooth Composite Functions and Non-Lipschitz Regularization5
How Do Exponential Size Solutions Arise in Semidefinite Programming?5
A Unified Framework for Pricing in Nonconvex Resource Allocation Games5
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods5
Evolution of Mixed Strategies in Monotone Games5
A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems5
Sequential Quadratic Optimization for Stochastic Optimization with Deterministic Nonlinear Inequality and Equality Constraints5
From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective5
Super-Universal Regularized Newton Method5
Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence5
Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity5
0.057603120803833