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-11-01 to 2025-11-01.)
ArticleCitations
Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming58
Convex Approximations of Random Constrained Markov Decision Processes46
Optimal Self-Concordant Barriers for Quantum Relative Entropies42
The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings37
Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function31
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity27
Occupation Measure Relaxations in Variational Problems: The Role of Convexity27
High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles25
Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions25
A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization24
On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials23
A Descent Algorithm for the Optimal Control of ReLU Neural Network Informed PDEs Based on Approximate Directional Derivatives22
An Approximation-Based Regularized Extra-Gradient Method for Monotone Variational Inequalities21
Convex Ternary Quartics Are SOS-Convex21
Reducing Nonnegativity over General Semialgebraic Sets to Nonnegativity over Simple Sets21
Refined TSSOS20
Fenchel Duality and a Separation Theorem on Hadamard Manifolds20
Variational Convexity of Functions and Variational Sufficiency in Optimization20
The Rate of Convergence of Bregman Proximal Methods: Local Geometry Versus Regularity Versus Sharpness19
Linear Programming on the Stiefel Manifold19
Solution of Mismatched Monotone+Lipschitz Inclusion Problems18
Harnessing Structure in Composite Nonsmooth Minimization17
On a Differential Generalized Nash Equilibrium Problem with Mean Field Interaction17
A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer16
Subgradient Sampling for Nonsmooth Nonconvex Minimization16
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints15
Optimal Convergence Rates for the Proximal Bundle Method15
Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods15
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems14
On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms14
Using Taylor-Approximated Gradients to Improve the Frank–Wolfe Method for Empirical Risk Minimization14
Fenchel–Young Inequality with a Remainder and Applications to Convex Duality and Optimal Transport14
The Ratio-Cut Polytope and K-Means Clustering14
The Computation of Approximate Feedback Stackelberg Equilibria in Multiplayer Nonlinear Constrained Dynamic Games14
Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part I: Convex Relaxations12
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs12
A Family of \(\boldsymbol{s}\)-Rectangular Robust MDPs: Relative Conservativeness, Asymptotic Analyses, and Finite-Sample Properties12
Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation12
On the Complexity of Matrix Putinar’s Positivstellensätz11
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints11
Convergence Analyses of Davis–Yin Splitting via Scaled Relative Graphs11
Decomposition Methods for Global Solution of Mixed-Integer Linear Programs11
Optimization on the Euclidean Unit Sphere10
Understanding the Influence of Digraphs on Decentralized Optimization: Effective Metrics, Lower Bound, and Optimal Algorithm10
Distributionally Robust Two-Stage Stochastic Programming10
A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems10
A Search-Free \({O(1/{k}^{3/2})}\) Homotopy Inexact Proximal-Newton Extragradient Algorithm for Monotone Variational Inequalities10
Convergent Algorithms for a Class of Convex Semi-infinite Programs10
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients10
A Disjunctive Cutting Plane Algorithm for Bilinear Programming10
On the Divergence of Decentralized Nonconvex Optimization10
The Stochastic Auxiliary Problem Principle in Banach Spaces: Measurability and Convergence9
A Four-Operator Splitting Algorithm for Nonconvex and Nonsmooth Optimization9
Degenerate Preconditioned Proximal Point Algorithms9
Consensus-Based Optimization Methods Converge Globally9
Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems9
Continuous Newton-like Methods Featuring Inertia and Variable Mass9
Randomized Iterative Methods for Generalized Absolute Value Equations: Solvability and Error Bounds9
Scalable Frank–Wolfe on Generalized Self-Concordant Functions via Simple Steps9
Escaping Unknown Discontinuous Regions in Blackbox Optimization9
Strong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) Spaces8
First-Order Penalty Methods for Bilevel Optimization8
Fisher–Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients8
A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees8
An Exact Method for Nonlinear Network Flow Interdiction Problems8
On Enhanced KKT Optimality Conditions for Smooth Nonlinear Optimization8
Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy8
Piecewise Polyhedral Relaxations of Multilinear Optimization8
Minimal Pairs of Convex Sets Which Share a Recession Cone8
Mini-Batch Risk Forms8
On the Bredies–Chenchene–Lorenz–Naldi Algorithm: Linear Relations and Strong Convergence8
Limiting Normal Cones to the Union of Two Convex Sets and M-Stationarity: Local Uniqueness and Stability in Mathematical Programming8
Proximity Operators of Perspective Functions with Nonlinear Scaling8
Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction8
Dynamic Stochastic Variational Inequalities and Convergence of Discrete Approximation7
Linearly Constrained Nonsmooth Optimization for Training Autoencoders7
New Methods for Parametric Optimization via Differential Equations7
Subdifferentially Polynomially Bounded Functions and Gaussian Smoothing–Based Zeroth-Order Optimization7
MINRES: From Negative Curvature Detection to Monotonicity Properties7
Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation7
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective7
Bayesian Joint Chance Constrained Optimization: Approximations and Statistical Consistency7
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems7
Algorithms to Solve Unbounded Convex Vector Optimization Problems7
A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization7
Performance Bounds for PDE-Constrained Optimization under Uncertainty7
Cyclic Coordinate Dual Averaging with Extrapolation6
Constrained Consensus-Based Optimization6
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems6
A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds6
Relaxation of Stochastic Dominance Constraints via Optimal Mass Transport6
Corrigendum: Convex Optimization Problems on Differentiable Sets6
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods6
Accelerating Preconditioned ADMM via Degenerate Proximal Point Mappings6
Parameter-Free Accelerated Gradient Descent for Nonconvex Minimization6
Sequential Quadratic Optimization for Stochastic Optimization with Deterministic Nonlinear Inequality and Equality Constraints6
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search6
Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency6
Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence6
Square Root LASSO: Well-Posedness, Lipschitz Stability, and the Tuning Trade-Off6
Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty6
Super-Universal Regularized Newton Method6
From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective6
On Cutting Plane Algorithms for Nonlinear Binary Optimization6
A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction5
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets5
Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy5
A Unified Framework for Pricing in Nonconvex Resource Allocation Games5
Evolution of Mixed Strategies in Monotone Games5
Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity5
Effective Scenarios in Multistage Distributionally Robust Optimization with a Focus on Total Variation Distance5
Bias Reduction in Sample-Based Optimization5
Policy Mirror Descent Inherently Explores Action Space5
Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient5
A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems5
An Improved Unconstrained Approach for Bilevel Optimization5
TRFD: A Derivative-Free Trust-Region Method Based on Finite Differences for Composite Nonsmooth Optimization5
Convergence Analysis of a Norm Minimization-Based Convex Vector Optimization Algorithm5
A Symmetric Gauss–Seidel Based Majorized Augmented Lagrangian Method for Generalized Nash Equilibrium Problems in Hilbert Spaces5
A Stochastic-Gradient-Based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems5
Convex Quadratic Sets and the Complexity of Mixed Integer Convex Quadratic Programming5
An Efficient Sieving-Based Secant Method for Sparse Optimization Problems with Least-Squares Constraints5
Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature5
Shape Optimization for Variational Inequalities: The Scalar Tresca Friction Problem5
Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence5
Adaptive Partitioning for Chance-Constrained Problems with Finite Support5
A Jacobi-Type Newton Method for Nash Equilibrium Problems with Descent Guarantees5
Complexity of Finite-Sum Optimization with Nonsmooth Composite Functions and Non-Lipschitz Regularization5
How Do Exponential Size Solutions Arise in Semidefinite Programming?5
Subset Selection and the Cone of Factor-Width-kMatrices5
Zeroth-Order Stochastic Compositional Algorithms for Risk-Aware Learning5
Bayesian Optimization with Expensive Integrands5
0.098013877868652