OOIR: Observatory of International Research

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-09-01 to 2025-09-01.)

Article	Citations
Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming	54
Occupation Measure Relaxations in Variational Problems: The Role of Convexity	45
A Descent Algorithm for the Optimal Control of ReLU Neural Network Informed PDEs Based on Approximate Directional Derivatives	33
Variational Convexity of Functions and Variational Sufficiency in Optimization	29
An Approximation-Based Regularized Extra-Gradient Method for Monotone Variational Inequalities	26
Reducing Nonnegativity over General Semialgebraic Sets to Nonnegativity over Simple Sets	26
A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization	23
High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles	23
Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions	22
On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials	22
Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function	21
Optimal Self-Concordant Barriers for Quantum Relative Entropies	20
Convex Approximations of Random Constrained Markov Decision Processes	20
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity	19
The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings	19
Fenchel Duality and a Separation Theorem on Hadamard Manifolds	18
Convex Ternary Quartics Are SOS-Convex	18
A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer	17
Fenchel–Young Inequality with a Remainder and Applications to Convex Duality and Optimal Transport	16
Subgradient Sampling for Nonsmooth Nonconvex Minimization	15
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints	15
On a Differential Generalized Nash Equilibrium Problem with Mean Field Interaction	15
The Rate of Convergence of Bregman Proximal Methods: Local Geometry Versus Regularity Versus Sharpness	14
Solution of Mismatched Monotone+Lipschitz Inclusion Problems	14
On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms	14

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods	14
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems	14
The Computation of Approximate Feedback Stackelberg Equilibria in Multiplayer Nonlinear Constrained Dynamic Games	14
Linear Programming on the Stiefel Manifold	13
Refined TSSOS	13
Harnessing Structure in Composite Nonsmooth Minimization	12
Optimal Convergence Rates for the Proximal Bundle Method	12
The Ratio-Cut Polytope and K-Means Clustering	12
Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation	11
Using Taylor-Approximated Gradients to Improve the Frank–Wolfe Method for Empirical Risk Minimization	11
Distributionally Robust Two-Stage Stochastic Programming	11
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs	11
Decomposition Methods for Global Solution of Mixed-Integer Linear Programs	11
Convergent Algorithms for a Class of Convex Semi-infinite Programs	10
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints	10
On the Complexity of Matrix Putinar’s Positivstellensätz	10
A Family of $\boldsymbol{s}$-Rectangular Robust MDPs: Relative Conservativeness, Asymptotic Analyses, and Finite-Sample Properties	10
Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part I: Convex Relaxations	10
Convergence Analyses of Davis–Yin Splitting via Scaled Relative Graphs	10
A Regularized Newton Method for ${\boldsymbol{\ell}}_{q}$ -Norm Composite Optimization Problems	9
Escaping Unknown Discontinuous Regions in Blackbox Optimization	9
On the Divergence of Decentralized Nonconvex Optimization	9
Continuous Newton-like Methods Featuring Inertia and Variable Mass	9
A Search-Free ${O(1/{k}^{3/2})}$ Homotopy Inexact Proximal-Newton Extragradient Algorithm for Monotone Variational Inequalities	9
A Disjunctive Cutting Plane Algorithm for Bilinear Programming	9
Optimization on the Euclidean Unit Sphere	9
Understanding the Influence of Digraphs on Decentralized Optimization: Effective Metrics, Lower Bound, and Optimal Algorithm	8
Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems	8
The Stochastic Auxiliary Problem Principle in Banach Spaces: Measurability and Convergence	8
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients	8
Degenerate Preconditioned Proximal Point Algorithms	8
A Four-Operator Splitting Algorithm for Nonconvex and Nonsmooth Optimization	8
First-Order Penalty Methods for Bilevel Optimization	8
Scalable Frank–Wolfe on Generalized Self-Concordant Functions via Simple Steps	8
Randomized Iterative Methods for Generalized Absolute Value Equations: Solvability and Error Bounds	8
Consensus-Based Optimization Methods Converge Globally	8
Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy	8
Minimal Pairs of Convex Sets Which Share a Recession Cone	7
An Exact Method for Nonlinear Network Flow Interdiction Problems	7
Piecewise Polyhedral Relaxations of Multilinear Optimization	7
Mini-Batch Risk Forms	7
Proximity Operators of Perspective Functions with Nonlinear Scaling	7
Fisher–Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients	7
A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees	7
Strong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) Spaces	7
Linearly Constrained Nonsmooth Optimization for Training Autoencoders	7
Dynamic Stochastic Variational Inequalities and Convergence of Discrete Approximation	7
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems	7
On Enhanced KKT Optimality Conditions for Smooth Nonlinear Optimization	7
Algorithms to Solve Unbounded Convex Vector Optimization Problems	7

MINRES: From Negative Curvature Detection to Monotonicity Properties	6
Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence	6
Subdifferentially Polynomially Bounded Functions and Gaussian Smoothing–Based Zeroth-Order Optimization	6
Bayesian Joint Chance Constrained Optimization: Approximations and Statistical Consistency	6
Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction	6
Square Root LASSO: Well-Posedness, Lipschitz Stability, and the Tuning Trade-Off	6
Parameter-Free Accelerated Gradient Descent for Nonconvex Minimization	6
Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation	6
A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization	6
A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds	6
Performance Bounds for PDE-Constrained Optimization under Uncertainty	6
Cyclic Coordinate Dual Averaging with Extrapolation	5
Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty	5
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- ${\boldsymbol{\mathcal{C}^2}}$ Objective	5
Complexity of Finite-Sum Optimization with Nonsmooth Composite Functions and Non-Lipschitz Regularization	5
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search	5
On Cutting Plane Algorithms for Nonlinear Binary Optimization	5
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets	5
A Unified Framework for Pricing in Nonconvex Resource Allocation Games	5
Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency	5
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods	5
Constrained Consensus-Based Optimization	5
New Methods for Parametric Optimization via Differential Equations	5
From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective	5
Corrigendum: Convex Optimization Problems on Differentiable Sets	5
Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy	5
Adaptive Partitioning for Chance-Constrained Problems with Finite Support	5
Super-Universal Regularized Newton Method	5
Accelerating Preconditioned ADMM via Degenerate Proximal Point Mappings	5
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems	5
TRFD: A Derivative-Free Trust-Region Method Based on Finite Differences for Composite Nonsmooth Optimization	5
Sequential Quadratic Optimization for Stochastic Optimization with Deterministic Nonlinear Inequality and Equality Constraints	5
A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems	5
An Improved Unconstrained Approach for Bilevel Optimization	5
Convergence Analysis of a Norm Minimization-Based Convex Vector Optimization Algorithm	5
A Jacobi-Type Newton Method for Nash Equilibrium Problems with Descent Guarantees	5