SIAM Journal on Optimization

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

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

Full Splitting Algorithms for Fractional Programs with Structured Numerators and Denominators	9
Consensus-Based Algorithms for Stochastic Optimization Problems	8
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems	8
MINRES: From Negative Curvature Detection to Monotonicity Properties	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
Stochastic Optimization under Hidden Convexity	8
Piecewise Polyhedral Relaxations of Multilinear Optimization	8
Bayesian Joint Chance Constrained Optimization: Approximations and Statistical Consistency	8
Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence	8
Accelerating Preconditioned ADMM via Degenerate Proximal Point Mappings	8
Linearly Constrained Nonsmooth Optimization for Training Autoencoders	8
Algorithms to Solve Unbounded Convex Vector Optimization Problems	8
A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds	8
Parameter-Free Accelerated Gradient Descent for Nonconvex Minimization	8
New Methods for Parametric Optimization via Differential Equations	8
Super-Universal Regularized Newton Method	7
Corrigendum: Convex Optimization Problems on Differentiable Sets	7
Performance Bounds for PDE-Constrained Optimization under Uncertainty	7
Cyclic Coordinate Dual Averaging with Extrapolation	7
Sequential Quadratic Optimization for Stochastic Optimization with Deterministic Nonlinear Inequality and Equality Constraints	7
Comprehensive Analysis of Kernel-Based Interior-Point Methods for the \({P}_{{*}}{(\kappa )}\)-LCP	7
From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective	7
On Cutting Plane Algorithms for Nonlinear Binary Optimization	7
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective	7
Relaxation of Stochastic Dominance Constraints via Optimal Mass Transport	7
Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency	7
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems	7
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods	7
Complexity of Finite-Sum Optimization with Nonsmooth Composite Functions and Non-Lipschitz Regularization	7
Constrained Consensus-Based Optimization	7
Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective	7
Non-degenerate Rigid Alignment in a Patch Framework	7
A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems	6
A Symmetric Gauss–Seidel Based Majorized Augmented Lagrangian Method for Generalized Nash Equilibrium Problems in Hilbert Spaces	6
A Unified Framework for Pricing in Nonconvex Resource Allocation Games	6
Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity	6
Nonsmooth Exact Penalty Methods for Equality-Constrained Optimization: Complexity and Implementation	6
Sparse Polynomial Matrix Optimization	6
TRFD: A Derivative-Free Trust-Region Method Based on Finite Differences for Composite Nonsmooth Optimization	6
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets	6
Computational Complexity of Sum-of-Squares Bounds for Copositive Programs	6
Moment-Sos and Spectral Hierarchies for Polynomial Optimization on the Sphere and Quantum de Finetti Theorems	6
Two-Norm Discrepancy and Convergence of the Stochastic Gradient Method with Application to Shape Optimization	6
Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence	6
A Jacobi-Type Newton Method for Nash Equilibrium Problems with Descent Guarantees	6
Adaptive Partitioning for Chance-Constrained Problems with Finite Support	6
Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy	6
An Improved Unconstrained Approach for Bilevel Optimization	6
Rockafellian Relaxation for PDE-Constrained Optimization with Distributional Ambiguity	6
Convergence Analysis of a Norm Minimization-Based Convex Vector Optimization Algorithm	6
Path-Following Methods for Maximum a Posteriori Estimators in Bayesian Hierarchical Models: How Estimates Depend on Hyperparameters	5
A Stochastic-Gradient-Based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems	5
Forward-Backward Algorithms Devised by Graphs	5
Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient	5
Second Order Conditions to Decompose Smooth Functions as Sums of Squares	5
A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming	5
Strongly Stable Stationary Points for a Class of Generalized Equations	5
Kurdyka–Łojasiewicz Exponent via Hadamard Parametrization	5
Projected Gradient Descent Accumulates at Bouligand Stationary Points	5
Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming	5
Shape Optimization for Variational Inequalities: The Scalar Tresca Friction Problem	5
An Efficient Sieving-Based Secant Method for Sparse Optimization Problems with Least-Squares Constraints	5
Convex Quadratic Sets and the Complexity of Mixed Integer Convex Quadratic Programming	5
Evolution of Mixed Strategies in Monotone Games	5
Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant	5
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	5
Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization	5
Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function	5
Tight Error Bounds for the Sign-Constrained Stiefel Manifold	5
Effective Scenarios in Multistage Distributionally Robust Optimization with a Focus on Total Variation Distance	5
A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction	5
Policy Mirror Descent Inherently Explores Action Space	5
Subset Selection and the Cone of Factor-Width-kMatrices	5
How Do Exponential Size Solutions Arise in Semidefinite Programming?	5
Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework	5
Bounds for Multistage Mixed-Integer Distributionally Robust Optimization	5
Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications	5
Convergence Rate of Random Scan Coordinate Ascent Variational Inference Under Log-Concavity	4
Model Construction for Convex-Constrained Derivative-Free Optimization	4

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls	4
Stochastic Trust-Region and Direct-Search Methods: A Weak Tail Bound Condition and Reduced Sample Sizing	4
Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions	4
Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems	4
First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems	4
Revisiting Landscape Analysis in Deep Neural Networks: Eliminating Decreasing Paths to Infinity	4
A Relaxed Quasinormality Condition and the Boundedness of Dual Augmented Lagrangian Sequences	4
Vector Asymptotic Functions and Their Application to Multiobjective Optimization Problems	4
Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems	4
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube	4
Accelerated Minimax Algorithms Flock Together	4
Sketched Newton--Raphson	4
Relative Lipschitz-like Property of Parametric Systems via Projectional Coderivatives	4
Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal	4
Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem	4
Pragmatic Distributionally Robust Optimization for Simple Integer Recourse Models	4
Cutting Plane Generation through Sparse Principal Component Analysis	4
Stability Analysis of Discrete-Time Linear Complementarity Systems	4
Accelerated Forward-Backward Optimization Using Deep Learning	4
Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems	4
Analysis of the SiMPL Method for Density-Based Topology Optimization	4
Finding Optimal Weight Vectors for Ridge Function Approximation in \(\boldsymbol{L}^{\boldsymbol{2}}\boldsymbol{(D)}\)	4
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems	4
Golden Ratio Primal-Dual Algorithm with Linesearch	4
A Particle Algorithm for Mean-Field Variational Inference	4
Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization	4
General Feasibility Bounds for Sample Average Approximation via Vapnik--Chervonenkis Dimension	4
Policy Gradient Algorithms for Robust MDP\(\text{s}\) with Nonrectangular Uncertainty Sets	4
Locating Theorems of Differential Inclusions Governed by Maximally Monotone Operators	4
Accelerating Primal-Dual Methods for Regularized Markov Decision Processes	4
Benign Landscapes of Low-Dimensional Relaxations for Orthogonal Synchronization on General Graphs	4
On Minimal Extended Representations of Generalized Power Cones	4
Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming	4
Derivative-Free Approaches for Chance-Constrained Problems with Right-Hand Side Uncertainty	4
A Quadratically Convergent Sequential Programming Method for Second-Order Cone Programs Capable of Warm Starts	3
Constraint Qualifications and Strong Global Convergence Properties of an Augmented Lagrangian Method on Riemannian Manifolds	3
Provably Faster Gradient Descent via Long Steps	3
Second-Order Subdifferential Optimality Conditions in Nonsmooth Optimization	3
Nonlinear Gradient Mappings and Stochastic Optimization: A General Framework with Applications to Heavy-Tail Noise	3
Moderate Deviations and Invariance Principles for Sample Average Approximations	3
The Derivatives of Sinkhorn–Knopp Converge	3
Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems	3
Monotonicity in Quadratically Regularized Linear Programs	3
Space Mapping for PDE Constrained Shape Optimization	3
Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems	3
Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming	3
A Solution Method for Arbitrary Polyhedral Convex Set Optimization Problems	3
Discrete Optimal Transport with Independent Marginals is #P-Hard	3
Certifying Solutions of Degenerate Semidefinite Programs	3
Smoothed Gradient Clipping and Error Feedback for Decentralized Optimization under Symmetric Heavy-Tailed Noise	3
An Inexact \({q}\)-Order Regularized Proximal Newton Method for Nonconvex Composite Optimization	3
Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients	3
Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training	3
A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions	3
Convergence Properties of Proximal (Sub)gradient Methods without Convexity or Smoothness of Any of the Functions	3
Block Majorization-Minimization with Diminishing Radius for Constrained Nonsmooth Nonconvex Optimization	3
Clarke’s Tangent Cones, Subgradients, Optimality Conditions, and the Lipschitzness at Infinity	3
Certifying the Absence of Spurious Local Minima at Infinity	3
TS-RSR: A Provably Efficient Approach for Batch Bayesian Optimization	3
A Finitely Convergent Circumcenter Method for the Convex Feasibility Problem	3
Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming	3
Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm	3
Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow	3
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates	3
Approximation Guarantees for Min-Max-Min Robust Optimization and \({\boldsymbol{k}}\)-Adaptability Under Objective Uncertainty	3
Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation	3
Fast Gradient Algorithm with Dry-like Friction and Nonmonotone Line Search for Nonconvex Optimization Problems	3
Interior-Point Algorithms with Full Newton Steps for Nonsymmetric Convex Conic Optimization	3
Sharper Bounds for Proximal Gradient Algorithms with Errors	3
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem	3
A Functional Model Method for Nonconvex Nonsmooth Conditional Stochastic Optimization	3
Towards Global Solutions for Nonconvex Two-Stage Stochastic Programs: A Polynomial Lower Approximation Approach	2
Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization	2
Adaptive Third-Order Methods for Composite Convex Optimization	2
New Interior-Point Algorithm for Linear Optimization Based on a Universal Tangent Direction	2
Model-Based Derivative-Free Methods for Convex-Constrained Optimization	2
Distributed Nonlinear Conic Optimization with Partially Separable Structure	2
Solving Moment and Polynomial Optimization Problems on Sobolev Spaces	2
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization	2
Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory	2
A Nonparametric Robust Optimization Approach for Chance-Constrained Knapsack Problem	2
Projected Newton Method for Large-Scale Bayesian Linear Inverse Problems	2
A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning	2
Avoiding Strict Saddle Points of Nonconvex Regularized Problems	2
On Integrality in Semidefinite Programming for Discrete Optimization	2
DIMIX: Diminishing Mixing for Sloppy Agents	2
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization	2
Approximations of Rockafellians, Lagrangians, and Dual Functions	2
Exponential Convergence of General Iterative Proportional Fitting Procedures	2
Convex Representatives of the Value Function and Aumann Integrals in Normed Spaces	2
Convergence of ZH-Type Nonmonotone Descent Method for Kurdyka–Łojasiewicz Optimization Problems	2
A General Framework for Symmetric and Asymmetric Variable Metric Proximal Point Methods, with Relations between Relative-Errors and Summable-Errors	2
Homotopy Methods for Convex Optimization	2
Stochastic Decomposition Method for Two-Stage Distributionally Robust Linear Optimization	2
Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality	2