SIAM Journal on Optimization

Papers
(The median citation count of SIAM Journal on Optimization is 2. 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
Subgradient Sampling for Nonsmooth Nonconvex Minimization16
A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer16
Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods15
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints15
Optimal Convergence Rates for the Proximal Bundle Method15
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
Scalable Frank–Wolfe on Generalized Self-Concordant Functions via Simple Steps9
Escaping Unknown Discontinuous Regions in Blackbox Optimization9
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
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
Corrigendum: Convex Optimization Problems on Differentiable Sets6
On Cutting Plane Algorithms for Nonlinear Binary Optimization6
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
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods6
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
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
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
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
Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization4
Locating Theorems of Differential Inclusions Governed by Maximally Monotone Operators4
Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization4
Relative Lipschitz-like Property of Parametric Systems via Projectional Coderivatives4
Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems4
Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions4
Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications4
Pragmatic Distributionally Robust Optimization for Simple Integer Recourse Models4
Forward-Backward Algorithms Devised by Graphs4
Bounds for Multistage Mixed-Integer Distributionally Robust Optimization4
Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function4
Second Order Conditions to Decompose Smooth Functions as Sums of Squares4
Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant4
Cutting Plane Generation through Sparse Principal Component Analysis4
Stability Analysis of Discrete-Time Linear Complementarity Systems4
Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds4
On Minimal Extended Representations of Generalized Power Cones4
Accelerating Primal-Dual Methods for Regularized Markov Decision Processes4
A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming4
Benign Landscapes of Low-Dimensional Relaxations for Orthogonal Synchronization on General Graphs4
Strongly Stable Stationary Points for a Class of Generalized Equations4
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 Intersection4
Projected Gradient Descent Accumulates at Bouligand Stationary Points4
Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework4
Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices4
First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems4
Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls4
Revisiting Landscape Analysis in Deep Neural Networks: Eliminating Decreasing Paths to Infinity4
Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem4
Golden Ratio Primal-Dual Algorithm with Linesearch4
Path-Following Methods for Maximum a Posteriori Estimators in Bayesian Hierarchical Models: How Estimates Depend on Hyperparameters4
General Feasibility Bounds for Sample Average Approximation via Vapnik--Chervonenkis Dimension4
Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming4
Tight Error Bounds for the Sign-Constrained Stiefel Manifold4
Kurdyka–Łojasiewicz Exponent via Hadamard Parametrization4
Second-Order Subdifferential Optimality Conditions in Nonsmooth Optimization3
Convergence Rate of Random Scan Coordinate Ascent Variational Inference Under Log-Concavity3
Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients3
Sketched Newton--Raphson3
Finding Optimal Weight Vectors for Ridge Function Approximation in \(\boldsymbol{L}^{\boldsymbol{2}}\boldsymbol{(D)}\)3
Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm3
Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems3
Nonlinear Gradient Mappings and Stochastic Optimization: A General Framework with Applications to Heavy-Tail Noise3
Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow3
TS-RSR: A Provably Efficient Approach for Batch Bayesian Optimization3
A Finitely Convergent Circumcenter Method for the Convex Feasibility Problem3
A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions3
Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming3
Moderate Deviations and Invariance Principles for Sample Average Approximations3
Provably Faster Gradient Descent via Long Steps3
A Relaxed Quasinormality Condition and the Boundedness of Dual Augmented Lagrangian Sequences3
Convexification with Bounded Gap for Randomly Projected Quadratic Optimization3
Stochastic Trust-Region and Direct-Search Methods: A Weak Tail Bound Condition and Reduced Sample Sizing3
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems3
First-Order Algorithms for a Class of Fractional Optimization Problems3
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube3
Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal3
Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming3
Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training3
The Derivatives of Sinkhorn–Knopp Converge3
Openness, Hölder Metric Regularity, and Hölder Continuity Properties of Semialgebraic Set-Valued Maps3
Derivative-Free Approaches for Chance-Constrained Problems with Right-Hand Side Uncertainty3
Partial Smoothness and Constant Rank3
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates3
Approximation Guarantees for Min-Max-Min Robust Optimization and \({\boldsymbol{k}}\)-Adaptability Under Objective Uncertainty3
Vector Asymptotic Functions and Their Application to Multiobjective Optimization Problems3
Corrigendum: Critical Cones for Sufficient Second Order Conditions in PDE Constrained Optimization3
Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming3
Analysis of the SiMPL Method for Density-Based Topology Optimization3
Accelerated Forward-Backward Optimization Using Deep Learning3
Accelerated Minimax Algorithms Flock Together3
An Inexact \({q}\)-Order Regularized Proximal Newton Method for Nonconvex Composite Optimization3
Discrete Optimal Transport with Independent Marginals is #P-Hard3
A Quadratically Convergent Sequential Programming Method for Second-Order Cone Programs Capable of Warm Starts3
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem3
Model Construction for Convex-Constrained Derivative-Free Optimization3
A Functional Model Method for Nonconvex Nonsmooth Conditional Stochastic Optimization2
Provably Accelerated Decentralized Gradient Methods Over Unbalanced Directed Graphs2
A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning2
On Squared-Variable Formulations2
Complexity-Optimal and Parameter-Free First-Order Methods for Finding Stationary Points of Composite Optimization Problems2
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations2
Fast Gradient Algorithm with Dry-like Friction and Nonmonotone Line Search for Nonconvex Optimization Problems2
Maximal Monotonicity and Cyclic Involutivity of Multiconjugate Convex Functions2
Approximating Higher-Order Derivative Tensors Using Secant Updates2
Constraint Qualifications and Strong Global Convergence Properties of an Augmented Lagrangian Method on Riemannian Manifolds2
Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials2
Clarke’s Tangent Cones, Subgradients, Optimality Conditions, and the Lipschitzness at Infinity2
Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems2
Simple and Optimal Methods for Stochastic Variational Inequalities, II: Markovian Noise and Policy Evaluation in Reinforcement Learning2
Robust Accelerated Primal-Dual Methods for Computing Saddle Points2
Model-Based Derivative-Free Methods for Convex-Constrained Optimization2
Fast Convergence of Inertial Multiobjective Gradient-Like Systems with Asymptotic Vanishing Damping2
Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization2
Condition Number Minimization in Euclidean Jordan Algebras2
Consistency of Sample-Based Stationary Points for Infinite-Dimensional Stochastic Optimization2
Sharper Bounds for Proximal Gradient Algorithms with Errors2
A Variational Approach to Weakly Continuous Relations in Banach Spaces2
Exact Augmented Lagrangian Duality for Mixed Integer Convex Optimization2
Finding Sparse Solutions for Packing and Covering Semidefinite Programs2
Addressing Hierarchical Jointly Convex Generalized Nash Equilibrium Problems with Nonsmooth Payoffs2
Monotonicity in Quadratically Regularized Linear Programs2
Affinely Adjustable Robust Linear Complementarity Problems2
Data-Driven Distributionally Robust Multiproduct Pricing Problems under Pure Characteristics Demand Models2
A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic2
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization2
Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs2
Extending the Rademacher Theorem to Set-Valued Maps2
The Semiconvex Regularization of Functions2
Proximal Gradient \(\boldsymbol{\mathcal{VU}}\)-Method with Superlinear Convergence for Nonsmooth Convex Optimization2
Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions2
Certifying the Absence of Spurious Local Minima at Infinity2
Fréchet Second-Order Subdifferentials of Lagrangian Functions and Optimality Conditions2
Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis2
A Solution Method for Arbitrary Polyhedral Convex Set Optimization Problems2
Bayesian Distributionally Robust Optimization2
Block Majorization-Minimization with Diminishing Radius for Constrained Nonsmooth Nonconvex Optimization2
Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation2
0.065824031829834