SIAM Journal on Optimization

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

Optimal Convergence Rates for the Proximal Bundle Method	17
Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods	17
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints	16
Fenchel–Young Inequality with a Remainder and Applications to Convex Duality and Optimal Transport	15
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems	15
The Computation of Approximate Feedback Stackelberg Equilibria in Multiplayer Nonlinear Constrained Dynamic Games	15
A Proximal-Gradient Method for Equality Constrained Optimization	14
On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms	14
The Ratio-Cut Polytope and K-Means Clustering	14
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs	13
Using Taylor-Approximated Gradients to Improve the Frank–Wolfe Method for Empirical Risk Minimization	13
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
Convergence Analyses of Davis–Yin Splitting via Scaled Relative Graphs	12
Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation	12
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints	11
A Search-Free \({O(1/{k}^{3/2})}\) Homotopy Inexact Proximal-Newton Extragradient Algorithm for Monotone Variational Inequalities	11
Decomposition Methods for Global Solution of Mixed-Integer Linear Programs	11
On the Complexity of Matrix Putinar’s Positivstellensätz	11
Convergent Algorithms for a Class of Convex Semi-infinite Programs	11
Distributionally Robust Two-Stage Stochastic Programming	11
On the Divergence of Decentralized Nonconvex Optimization	11
A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems	10
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients	10
Escaping Unknown Discontinuous Regions in Blackbox Optimization	10
Continuous Newton-like Methods Featuring Inertia and Variable Mass	10
Understanding the Influence of Digraphs on Decentralized Optimization: Effective Metrics, Lower Bound, and Optimal Algorithm	10
Optimization on the Euclidean Unit Sphere	10
A Four-Operator Splitting Algorithm for Nonconvex and Nonsmooth Optimization	10
Scalable Frank–Wolfe on Generalized Self-Concordant Functions via Simple Steps	10
A Disjunctive Cutting Plane Algorithm for Bilinear Programming	10
Consensus-Based Optimization Methods Converge Globally	10
Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems	10
Randomized Iterative Methods for Generalized Absolute Value Equations: Solvability and Error Bounds	10
Degenerate Preconditioned Proximal Point Algorithms	9
Limiting Normal Cones to the Union of Two Convex Sets and M-Stationarity: Local Uniqueness and Stability in Mathematical Programming	9
The Stochastic Auxiliary Problem Principle in Banach Spaces: Measurability and Convergence	9
Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy	9
First-Order Penalty Methods for Bilevel Optimization	9
Mini-Batch Risk Forms	9
On Enhanced KKT Optimality Conditions for Smooth Nonlinear Optimization	9
Linearly Constrained Nonsmooth Optimization for Training Autoencoders	8
A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees	8
Algorithms to Solve Unbounded Convex Vector Optimization Problems	8
Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation	8
Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction	8
Strong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) Spaces	8
Fisher–Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients	8
Minimal Pairs of Convex Sets Which Share a Recession Cone	8
Stochastic Optimization under Hidden Convexity	8

An Exact Method for Nonlinear Network Flow Interdiction Problems	8
MINRES: From Negative Curvature Detection to Monotonicity Properties	8
On the Bredies–Chenchene–Lorenz–Naldi Algorithm: Linear Relations and Strong Convergence	8
Proximity Operators of Perspective Functions with Nonlinear Scaling	8
Dynamic Stochastic Variational Inequalities and Convergence of Discrete Approximation	8
Consensus-Based Algorithms for Stochastic Optimization Problems	8
Piecewise Polyhedral Relaxations of Multilinear Optimization	8
Constrained Consensus-Based Optimization	7
Subdifferentially Polynomially Bounded Functions and Gaussian Smoothing–Based Zeroth-Order Optimization	7
A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization	7
New Methods for Parametric Optimization via Differential Equations	7
Full Splitting Algorithms for Fractional Programs with Structured Numerators and Denominators	7
A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds	7
Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence	7
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems	7
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective	7
Parameter-Free Accelerated Gradient Descent for Nonconvex Minimization	7
Accelerating Preconditioned ADMM via Degenerate Proximal Point Mappings	7
Bayesian Joint Chance Constrained Optimization: Approximations and Statistical Consistency	7
Performance Bounds for PDE-Constrained Optimization under Uncertainty	7
Sequential Quadratic Optimization for Stochastic Optimization with Deterministic Nonlinear Inequality and Equality Constraints	6
Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency	6
From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective	6
A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems	6
A Jacobi-Type Newton Method for Nash Equilibrium Problems with Descent Guarantees	6
An Improved Unconstrained Approach for Bilevel Optimization	6
Square Root LASSO: Well-Posedness, Lipschitz Stability, and the Tuning Trade-Off	6
Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty	6
Cyclic Coordinate Dual Averaging with Extrapolation	6
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems	6
Complexity of Finite-Sum Optimization with Nonsmooth Composite Functions and Non-Lipschitz Regularization	6
A Symmetric Gauss–Seidel Based Majorized Augmented Lagrangian Method for Generalized Nash Equilibrium Problems in Hilbert Spaces	6
Convergence Analysis of a Norm Minimization-Based Convex Vector Optimization Algorithm	6
Relaxation of Stochastic Dominance Constraints via Optimal Mass Transport	6
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods	6
Super-Universal Regularized Newton Method	6
On Cutting Plane Algorithms for Nonlinear Binary Optimization	6
TRFD: A Derivative-Free Trust-Region Method Based on Finite Differences for Composite Nonsmooth Optimization	6
Adaptive Partitioning for Chance-Constrained Problems with Finite Support	6
Corrigendum: Convex Optimization Problems on Differentiable Sets	6
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search	6
Bias Reduction in Sample-Based Optimization	5
Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy	5
Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity	5
Computational Complexity of Sum-of-Squares Bounds for Copositive Programs	5
Zeroth-Order Stochastic Compositional Algorithms for Risk-Aware Learning	5
A Stochastic-Gradient-Based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems	5
Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications	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
Second Order Conditions to Decompose Smooth Functions as Sums of Squares	5
How Do Exponential Size Solutions Arise in Semidefinite Programming?	5
Convex Quadratic Sets and the Complexity of Mixed Integer Convex Quadratic Programming	5
An Efficient Sieving-Based Secant Method for Sparse Optimization Problems with Least-Squares Constraints	5
Effective Scenarios in Multistage Distributionally Robust Optimization with a Focus on Total Variation Distance	5
Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence	5
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets	5
Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient	5
Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant	5
Kurdyka–Łojasiewicz Exponent via Hadamard Parametrization	5
Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization	5
Forward-Backward Algorithms Devised by Graphs	5
Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function	5
Bayesian Optimization with Expensive Integrands	5
Policy Mirror Descent Inherently Explores Action Space	5
Evolution of Mixed Strategies in Monotone Games	5
A Unified Framework for Pricing in Nonconvex Resource Allocation Games	5
Subset Selection and the Cone of Factor-Width-kMatrices	5
Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature	5
Strongly Stable Stationary Points for a Class of Generalized Equations	5
Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices	5
Tight Error Bounds for the Sign-Constrained Stiefel Manifold	5
Shape Optimization for Variational Inequalities: The Scalar Tresca Friction Problem	5
A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction	5
Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework	4
Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming	4
Bounds for Multistage Mixed-Integer Distributionally Robust Optimization	4
Cutting Plane Generation through Sparse Principal Component Analysis	4
Second-Order Subdifferential Optimality Conditions in Nonsmooth Optimization	4
Convexification with Bounded Gap for Randomly Projected Quadratic Optimization	4
Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients	4

Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem	4
Relative Lipschitz-like Property of Parametric Systems via Projectional Coderivatives	4
Stochastic Trust-Region and Direct-Search Methods: A Weak Tail Bound Condition and Reduced Sample Sizing	4
Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems	4
Locating Theorems of Differential Inclusions Governed by Maximally Monotone Operators	4
Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization	4
Path-Following Methods for Maximum a Posteriori Estimators in Bayesian Hierarchical Models: How Estimates Depend on Hyperparameters	4
First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems	4
Golden Ratio Primal-Dual Algorithm with Linesearch	4
Convergence Rate of Random Scan Coordinate Ascent Variational Inference Under Log-Concavity	4
On Minimal Extended Representations of Generalized Power Cones	4
Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls	4
Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions	4
Revisiting Landscape Analysis in Deep Neural Networks: Eliminating Decreasing Paths to Infinity	4
Corrigendum: Critical Cones for Sufficient Second Order Conditions in PDE Constrained Optimization	4
Sketched Newton--Raphson	4
Benign Landscapes of Low-Dimensional Relaxations for Orthogonal Synchronization on General Graphs	4
Projected Gradient Descent Accumulates at Bouligand Stationary Points	4
A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming	4
General Feasibility Bounds for Sample Average Approximation via Vapnik--Chervonenkis Dimension	4
Pragmatic Distributionally Robust Optimization for Simple Integer Recourse Models	4
Approximation Guarantees for Min-Max-Min Robust Optimization and \({\boldsymbol{k}}\)-Adaptability Under Objective Uncertainty	4
Vector Asymptotic Functions and Their Application to Multiobjective Optimization Problems	4
Accelerating Primal-Dual Methods for Regularized Markov Decision Processes	4
A Relaxed Quasinormality Condition and the Boundedness of Dual Augmented Lagrangian Sequences	4
Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds	4
Stability Analysis of Discrete-Time Linear Complementarity Systems	4
Provably Faster Gradient Descent via Long Steps	3
Finding Sparse Solutions for Packing and Covering Semidefinite Programs	3
Block Majorization-Minimization with Diminishing Radius for Constrained Nonsmooth Nonconvex Optimization	3
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem	3
A Solution Method for Arbitrary Polyhedral Convex Set Optimization Problems	3
Analysis of the SiMPL Method for Density-Based Topology Optimization	3
TS-RSR: A Provably Efficient Approach for Batch Bayesian Optimization	3
Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming	3
Discrete Optimal Transport with Independent Marginals is #P-Hard	3
An Inexact \({q}\)-Order Regularized Proximal Newton Method for Nonconvex Composite Optimization	3
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates	3
Moderate Deviations and Invariance Principles for Sample Average Approximations	3
Derivative-Free Approaches for Chance-Constrained Problems with Right-Hand Side Uncertainty	3
Accelerated Minimax Algorithms Flock Together	3
Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming	3
Constraint Qualifications and Strong Global Convergence Properties of an Augmented Lagrangian Method on Riemannian Manifolds	3
Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training	3
Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems	3
Simple and Optimal Methods for Stochastic Variational Inequalities, II: Markovian Noise and Policy Evaluation in Reinforcement Learning	3
Accelerated Forward-Backward Optimization Using Deep Learning	3
Openness, Hölder Metric Regularity, and Hölder Continuity Properties of Semialgebraic Set-Valued Maps	3
Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow	3
A Finitely Convergent Circumcenter Method for the Convex Feasibility Problem	3
Model Construction for Convex-Constrained Derivative-Free Optimization	3
Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm	3
Partial Smoothness and Constant Rank	3
Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal	3
A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions	3
Monotonicity in Quadratically Regularized Linear Programs	3
Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems	3
Affinely Adjustable Robust Linear Complementarity Problems	3
Finding Optimal Weight Vectors for Ridge Function Approximation in \(\boldsymbol{L}^{\boldsymbol{2}}\boldsymbol{(D)}\)	3
Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation	3
First-Order Algorithms for a Class of Fractional Optimization Problems	3
A Quadratically Convergent Sequential Programming Method for Second-Order Cone Programs Capable of Warm Starts	3
The Derivatives of Sinkhorn–Knopp Converge	3
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube	3
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems	3
Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming	3
Nonlinear Gradient Mappings and Stochastic Optimization: A General Framework with Applications to Heavy-Tail Noise	3
Projected Newton Method for Large-Scale Bayesian Linear Inverse Problems	2
Condition Number Minimization in Euclidean Jordan Algebras	2
Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization	2
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations	2
Fast Convergence of Inertial Multiobjective Gradient-Like Systems with Asymptotic Vanishing Damping	2
The Semiconvex Regularization of Functions	2
Constrained Optimization in the Presence of Noise	2
DIMIX: Diminishing Mixing for Sloppy Agents	2
Model-Based Derivative-Free Methods for Convex-Constrained Optimization	2
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization	2
Solving Moment and Polynomial Optimization Problems on Sobolev Spaces	2
Complexity-Optimal and Parameter-Free First-Order Methods for Finding Stationary Points of Composite Optimization Problems	2
On Squared-Variable Formulations	2
Homotopy Methods for Convex Optimization	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
Stochastic Decomposition Method for Two-Stage Distributionally Robust Linear Optimization	2
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization	2
Approximations of Rockafellians, Lagrangians, and Dual Functions	2
Towards Global Solutions for Nonconvex Two-Stage Stochastic Programs: A Polynomial Lower Approximation Approach	2
Extending the Rademacher Theorem to Set-Valued Maps	2
Addressing Hierarchical Jointly Convex Generalized Nash Equilibrium Problems with Nonsmooth Payoffs	2
Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality	2
Fast Gradient Algorithm with Dry-like Friction and Nonmonotone Line Search for Nonconvex Optimization Problems	2
Adaptive Third-Order Methods for Composite Convex Optimization	2
A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning	2
On Integrality in Semidefinite Programming for Discrete Optimization	2
Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions	2