OOIR: Observatory of International Research

Papers

(The TQCC of SIAM Journal on Optimization is 6. 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 2022-05-01 to 2026-05-01.)

Article	Citations
Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming	72
The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings	60
An Approximation-Based Regularized Extra-Gradient Method for Monotone Variational Inequalities	54
On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials	37
Convex Ternary Quartics Are SOS-Convex	36
Reducing Nonnegativity over General Semialgebraic Sets to Nonnegativity over Simple Sets	35
Variational Convexity of Functions and Variational Sufficiency in Optimization	31
Effective Front-Descent Algorithms with Convergence Guarantees	29
A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization	27
High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles	26
Convex Approximations of Random Constrained Markov Decision Processes	25
Large Deviation Upper Bounds and Improved MSE Rates of Nonlinear SGD: Heavy-Tailed Noise and Power of Symmetry	24
Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions	23
Optimal Self-Concordant Barriers for Quantum Relative Entropies	22
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity	22
Fenchel Duality and a Separation Theorem on Hadamard Manifolds	21
Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function	21
Occupation Measure Relaxations in Variational Problems: The Role of Convexity	21
Refined TSSOS	21
A Descent Algorithm for the Optimal Control of ReLU Neural Network Informed PDEs Based on Approximate Directional Derivatives	21
The Rate of Convergence of Bregman Proximal Methods: Local Geometry Versus Regularity Versus Sharpness	20
Solution of Mismatched Monotone+Lipschitz Inclusion Problems	19
Harnessing Structure in Composite Nonsmooth Minimization	18
On a Differential Generalized Nash Equilibrium Problem with Mean Field Interaction	18
A QP1QC Approach for Deciding Whether or Not Two Quadratic Surfaces Intersect	17

A Proximal-Gradient Method for Equality Constrained Optimization	16
Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods	16
Fenchel–Young Inequality with a Remainder and Applications to Convex Duality and Optimal Transport	16
Linear Programming on the Stiefel Manifold	15
Subgradient Sampling for Nonsmooth Nonconvex Minimization	15
The Computation of Approximate Feedback Stackelberg Equilibria in Multiplayer Nonlinear Constrained Dynamic Games	15
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints	15
Optimal Convergence Rates for the Proximal Bundle Method	14
Convergence Rates of Sum-of-Squares Hierarchies for Polynomial Semidefinite Programs	14
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems	14
On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms	14
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs	13
A Family of $\boldsymbol{s}$-Rectangular Robust MDPs: Relative Conservativeness, Asymptotic Analyses, and Finite-Sample Properties	13
Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation	13
Using Taylor-Approximated Gradients to Improve the Frank–Wolfe Method for Empirical Risk Minimization	13
Decomposition Methods for Global Solution of Mixed-Integer Linear Programs	13
Distributionally Robust Two-Stage Stochastic Programming	12
Optimization on the Euclidean Unit Sphere	12
On the Divergence of Decentralized Nonconvex Optimization	12
Convergence Analyses of Davis–Yin Splitting via Scaled Relative Graphs	12
Convergent Algorithms for a Class of Convex Semi-infinite Programs	12
A Disjunctive Cutting Plane Algorithm for Bilinear Programming	12
On the Complexity of Matrix Putinar’s Positivstellensätz	12
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints	12
A Search-Free ${O(1/{k}^{3/2})}$ Homotopy Inexact Proximal-Newton Extragradient Algorithm for Monotone Variational Inequalities	12
Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part I: Convex Relaxations	12
A Four-Operator Splitting Algorithm for Nonconvex and Nonsmooth Optimization	11
Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems	11
Scalable Frank–Wolfe on Generalized Self-Concordant Functions via Simple Steps	11
Continuous Newton-like Methods Featuring Inertia and Variable Mass	11
Randomized Iterative Methods for Generalized Absolute Value Equations: Solvability and Error Bounds	11
Escaping Unknown Discontinuous Regions in Blackbox Optimization	10
Degenerate Preconditioned Proximal Point Algorithms	10
The Stochastic Auxiliary Problem Principle in Banach Spaces: Measurability and Convergence	10
Exploring Chordal Sparsity in Semidefinite Programming with Sparse plus Low-Rank Data Matrices	10
Mini-Batch Risk Forms	10
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients	10
A Regularized Newton Method for ${\boldsymbol{\ell}}_{q}$ -Norm Composite Optimization Problems	10
Strong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) Spaces	10
Tightness of SDP and Burer–Monteiro Factorization for Phase Synchronization in a High-Noise Regime	10
Understanding the Influence of Digraphs on Decentralized Optimization: Effective Metrics, Lower Bound, and Optimal Algorithm	10
Consensus-Based Optimization Methods Converge Globally	10
On Enhanced KKT Optimality Conditions for Smooth Nonlinear Optimization	10
First-Order Penalty Methods for Bilevel Optimization	10
Minimal Pairs of Convex Sets Which Share a Recession Cone	9
Fisher–Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients	9
Proximity Operators of Perspective Functions with Nonlinear Scaling	9
Limiting Normal Cones to the Union of Two Convex Sets and M-Stationarity: Local Uniqueness and Stability in Mathematical Programming	9
MINRES: From Negative Curvature Detection to Monotonicity Properties	9
On the Bredies–Chenchene–Lorenz–Naldi Algorithm: Linear Relations and Strong Convergence	9

A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees	9
Dynamic Stochastic Variational Inequalities and Convergence of Discrete Approximation	9
An Exact Method for Nonlinear Network Flow Interdiction Problems	9
Linearly Constrained Nonsmooth Optimization for Training Autoencoders	9
Stochastic Optimization under Hidden Convexity	8
Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation	8
Bayesian Joint Chance Constrained Optimization: Approximations and Statistical Consistency	8
Subdifferentially Polynomially Bounded Functions and Gaussian Smoothing–Based Zeroth-Order Optimization	8
Square Root LASSO: Well-Posedness, Lipschitz Stability, and the Tuning Trade-Off	8
Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence	8
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems	8
Algorithms to Solve Unbounded Convex Vector Optimization Problems	8
New Methods for Parametric Optimization via Differential Equations	8
Full Splitting Algorithms for Fractional Programs with Structured Numerators and Denominators	8
A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds	8
Accelerating Preconditioned ADMM via Degenerate Proximal Point Mappings	8
Piecewise Polyhedral Relaxations of Multilinear Optimization	8
Consensus-Based Algorithms for Stochastic Optimization Problems	8
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- ${\boldsymbol{\mathcal{C}^2}}$ Objective	8
Parameter-Free Accelerated Gradient Descent for Nonconvex Minimization	8
Performance Bounds for PDE-Constrained Optimization under Uncertainty	8
Constrained Consensus-Based Optimization	8
Super-Universal Regularized Newton Method	7
TRFD: A Derivative-Free Trust-Region Method Based on Finite Differences for Composite Nonsmooth Optimization	7
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods	7
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search	7
Complexity of Finite-Sum Optimization with Nonsmooth Composite Functions and Non-Lipschitz Regularization	7
Corrigendum: Convex Optimization Problems on Differentiable Sets	7
A Jacobi-Type Newton Method for Nash Equilibrium Problems with Descent Guarantees	7
Non-degenerate Rigid Alignment in a Patch Framework	7
Relaxation of Stochastic Dominance Constraints via Optimal Mass Transport	7
Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency	7
Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective	7
On Cutting Plane Algorithms for Nonlinear Binary Optimization	7
Cyclic Coordinate Dual Averaging with Extrapolation	7
Sequential Quadratic Optimization for Stochastic Optimization with Deterministic Nonlinear Inequality and Equality Constraints	7
From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective	7
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems	7
Convergence Analysis of a Norm Minimization-Based Convex Vector Optimization Algorithm	6
Computational Complexity of Sum-of-Squares Bounds for Copositive Programs	6
Two-Norm Discrepancy and Convergence of the Stochastic Gradient Method with Application to Shape Optimization	6
Rockafellian Relaxation for PDE-Constrained Optimization with Distributional Ambiguity	6
Sparse Polynomial Matrix Optimization	6
Policy Mirror Descent Inherently Explores Action Space	6
Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature	6
Convex Quadratic Sets and the Complexity of Mixed Integer Convex Quadratic Programming	6
Nonsmooth Exact Penalty Methods for Equality-Constrained Optimization: Complexity and Implementation	6
A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems	6
A Unified Framework for Pricing in Nonconvex Resource Allocation Games	6
A Symmetric Gauss–Seidel Based Majorized Augmented Lagrangian Method for Generalized Nash Equilibrium Problems in Hilbert Spaces	6
Regularized Newton Method with Global ${\boldsymbol{\mathcal{O}(1/{k}^2)}}$ Convergence	6
An Efficient Sieving-Based Secant Method for Sparse Optimization Problems with Least-Squares Constraints	6
Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient	6
Subset Selection and the Cone of Factor-Width-kMatrices	6
Moment-Sos and Spectral Hierarchies for Polynomial Optimization on the Sphere and Quantum de Finetti Theorems	6
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets	6
Adaptive Partitioning for Chance-Constrained Problems with Finite Support	6
An Improved Unconstrained Approach for Bilevel Optimization	6
Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity	6
How Do Exponential Size Solutions Arise in Semidefinite Programming?	6
Forward-Backward Algorithms Devised by Graphs	6
Evolution of Mixed Strategies in Monotone Games	6
Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy	6