OOIR: Observatory of International Research

Papers

(The TQCC of SIAM Journal on Optimization is 4. 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-06-01 to 2025-06-01.)

Article	Citations
Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming	43
Reducing Nonnegativity over General Semialgebraic Sets to Nonnegativity over Simple Sets	43
Optimal Self-Concordant Barriers for Quantum Relative Entropies	27
Variational Convexity of Functions and Variational Sufficiency in Optimization	27
High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles	22
On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials	21
A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization	21
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity	20
Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions	19
A Descent Algorithm for the Optimal Control of ReLU Neural Network Informed PDEs Based on Approximate Directional Derivatives	18
Occupation Measure Relaxations in Variational Problems: The Role of Convexity	17
Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function	17
Fenchel Duality and a Separation Theorem on Hadamard Manifolds	16
The Ratio-Cut Polytope and K-Means Clustering	16
On a Differential Generalized Nash Equilibrium Problem with Mean Field Interaction	15
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints	15
Fenchel–Young Inequality with a Remainder and Applications to Convex Duality and Optimal Transport	15
A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer	15
Harnessing Structure in Composite Nonsmooth Minimization	13
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems	13
The Rate of Convergence of Bregman Proximal Methods: Local Geometry Versus Regularity Versus Sharpness	13
On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms	12
The Computation of Approximate Feedback Stackelberg Equilibria in Multiplayer Nonlinear Constrained Dynamic Games	12
Solution of Mismatched Monotone+Lipschitz Inclusion Problems	12
Refined TSSOS	12

Subgradient Sampling for Nonsmooth Nonconvex Minimization	12
Linear Programming on the Stiefel Manifold	12
Optimal Convergence Rates for the Proximal Bundle Method	12
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs	11
Using Taylor-Approximated Gradients to Improve the Frank–Wolfe Method for Empirical Risk Minimization	11
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints	10
Distributionally Robust Two-Stage Stochastic Programming	10
Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part I: Convex Relaxations	10
Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation	10
A Family of $\boldsymbol{s}$-Rectangular Robust MDPs: Relative Conservativeness, Asymptotic Analyses, and Finite-Sample Properties	10
On the Divergence of Decentralized Nonconvex Optimization	9
On the Complexity of Matrix Putinar’s Positivstellensätz	9
Convergent Algorithms for a Class of Convex Semi-infinite Programs	9
Convergence Analyses of Davis–Yin Splitting via Scaled Relative Graphs	9
A Disjunctive Cutting Plane Algorithm for Bilinear Programming	9
Decomposition Methods for Global Solution of Mixed-Integer Linear Programs	9
Consensus-Based Optimization Methods Converge Globally	8
A Regularized Newton Method for ${\boldsymbol{\ell}}_{q}$ -Norm Composite Optimization Problems	8
Escaping Unknown Discontinuous Regions in Blackbox Optimization	8
A Search-Free ${O(1/{k}^{3/2})}$ Homotopy Inexact Proximal-Newton Extragradient Algorithm for Monotone Variational Inequalities	8
Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems	8
Optimization on the Euclidean Unit Sphere	8
Scalable Frank–Wolfe on Generalized Self-Concordant Functions via Simple Steps	8
Degenerate Preconditioned Proximal Point Algorithms	8
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients	8
Continuous Newton-like Methods Featuring Inertia and Variable Mass	8
Strong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) Spaces	7
The Stochastic Auxiliary Problem Principle in Banach Spaces: Measurability and Convergence	7
Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy	7
Algorithms to Solve Unbounded Convex Vector Optimization Problems	7
First-Order Penalty Methods for Bilevel Optimization	7
Mini-Batch Risk Forms	7
Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction	7
Piecewise Polyhedral Relaxations of Multilinear Optimization	7
On Enhanced KKT Optimality Conditions for Smooth Nonlinear Optimization	7
MINRES: From Negative Curvature Detection to Monotonicity Properties	7
Fisher–Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients	7
A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization	7
A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees	6
Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation	6
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems	6
Minimal Pairs of Convex Sets Which Share a Recession Cone	6
Linearly Constrained Nonsmooth Optimization for Training Autoencoders	6
Proximity Operators of Perspective Functions with Nonlinear Scaling	6
An Exact Method for Nonlinear Network Flow Interdiction Problems	6
Dynamic Stochastic Variational Inequalities and Convergence of Discrete Approximation	6
Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty	5
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems	5
A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds	5
Square Root LASSO: Well-Posedness, Lipschitz Stability, and the Tuning Trade-Off	5

Super-Universal Regularized Newton Method	5
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods	5
Cyclic Coordinate Dual Averaging with Extrapolation	5
Bayesian Joint Chance Constrained Optimization: Approximations and Statistical Consistency	5
Performance Bounds for PDE-Constrained Optimization under Uncertainty	5
Parameter-Free Accelerated Gradient Descent for Nonconvex Minimization	5
Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency	5
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search	5
From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective	5
Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence	5
Constrained Consensus-Based Optimization	5
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- ${\boldsymbol{\mathcal{C}^2}}$ Objective	5
Accelerating Preconditioned ADMM via Degenerate Proximal Point Mappings	5
Sequential Quadratic Optimization for Stochastic Optimization with Deterministic Nonlinear Inequality and Equality Constraints	5
Subset Selection and the Cone of Factor-Width-kMatrices	4
Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization	4
Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function	4
Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming	4
The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection	4
An Efficient Sieving-Based Secant Method for Sparse Optimization Problems with Least-Squares Constraints	4
A Unified Framework for Pricing in Nonconvex Resource Allocation Games	4
Shape Optimization for Variational Inequalities: The Scalar Tresca Friction Problem	4
How Do Exponential Size Solutions Arise in Semidefinite Programming?	4
Regularized Newton Method with Global ${\boldsymbol{\mathcal{O}(1/{k}^2)}}$ Convergence	4
Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy	4
A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems	4
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets	4
Effective Scenarios in Multistage Distributionally Robust Optimization with a Focus on Total Variation Distance	4
Strongly Stable Stationary Points for a Class of Generalized Equations	4
Tight Error Bounds for the Sign-Constrained Stiefel Manifold	4
Bayesian Optimization with Expensive Integrands	4
A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction	4
Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient	4
Bounds for Multistage Mixed-Integer Distributionally Robust Optimization	4
Evolution of Mixed Strategies in Monotone Games	4
Corrigendum: Convex Optimization Problems on Differentiable Sets	4
Convergence Analysis of a Norm Minimization-Based Convex Vector Optimization Algorithm	4
Adaptive Partitioning for Chance-Constrained Problems with Finite Support	4
Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature	4
A Stochastic-Gradient-Based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems	4
Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices	4
Kurdyka–Łojasiewicz Exponent via Hadamard Parametrization	4
Bias Reduction in Sample-Based Optimization	4
Zeroth-Order Stochastic Compositional Algorithms for Risk-Aware Learning	4
Policy Mirror Descent Inherently Explores Action Space	4
Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity	4
An Improved Unconstrained Approach for Bilevel Optimization	4
Complexity of Finite-Sum Optimization with Nonsmooth Composite Functions and Non-Lipschitz Regularization	4