SIAM Journal on Optimization

Article	Citations
Reducing Nonnegativity over General Semialgebraic Sets to Nonnegativity over Simple Sets	43
Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming	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
Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function	17
Occupation Measure Relaxations in Variational Problems: The Role of Convexity	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
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 Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms	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
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
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints	10
Distributionally Robust Two-Stage Stochastic Programming	10
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
On the Divergence of Decentralized Nonconvex Optimization	9
On the Complexity of Matrix Putinar’s Positivstellensätz	9
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
Consensus-Based Optimization Methods Converge Globally	8
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
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
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
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
Constrained Consensus-Based Optimization	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
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
Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty	5
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems	5
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
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
Revisiting Landscape Analysis in Deep Neural Networks: Eliminating Decreasing Paths to Infinity	3
Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization	3
Projected Gradient Descent Accumulates at Bouligand Stationary Points	3
Second Order Conditions to Decompose Smooth Functions as Sums of Squares	3
Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications	3
General Feasibility Bounds for Sample Average Approximation via Vapnik--Chervonenkis Dimension	3
Nonlinear Gradient Mappings and Stochastic Optimization: A General Framework with Applications to Heavy-Tail Noise	3
Sketched Newton--Raphson	3
Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls	3
Benign Landscapes of Low-Dimensional Relaxations for Orthogonal Synchronization on General Graphs	3
Pragmatic Distributionally Robust Optimization for Simple Integer Recourse Models	3
Locating Theorems of Differential Inclusions Governed by Maximally Monotone Operators	3
A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming	3
Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant	3
Path-Following Methods for Maximum a Posteriori Estimators in Bayesian Hierarchical Models: How Estimates Depend on Hyperparameters	3
Cutting Plane Generation through Sparse Principal Component Analysis	3
First-Order Algorithms for a Class of Fractional Optimization Problems	3
Vector Asymptotic Functions and Their Application to Multiobjective Optimization Problems	3
Stochastic Trust-Region and Direct-Search Methods: A Weak Tail Bound Condition and Reduced Sample Sizing	3
Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems	3
Accelerating Primal-Dual Methods for Regularized Markov Decision Processes	3
First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems	3
Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds	3
Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework	3
Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions	3
Relative Lipschitz-like Property of Parametric Systems via Projectional Coderivatives	3
Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem	3
Corrigendum: Critical Cones for Sufficient Second Order Conditions in PDE Constrained Optimization	3
On Minimal Extended Representations of Generalized Power Cones	3
Golden Ratio Primal-Dual Algorithm with Linesearch	3
Stability Analysis of Discrete-Time Linear Complementarity Systems	3
Partial Smoothness and Constant Rank	2

Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems	2
Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients	2
Openness, Hölder Metric Regularity, and Hölder Continuity Properties of Semialgebraic Set-Valued Maps	2
Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal	2
A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic	2
An Inexact \({q}\)-Order Regularized Proximal Newton Method for Nonconvex Composite Optimization	2
Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems	2
Accelerated Minimax Algorithms Flock Together	2
Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation	2
Convexification with Bounded Gap for Randomly Projected Quadratic Optimization	2
Block Majorization-Minimization with Diminishing Radius for Constrained Nonsmooth Nonconvex Optimization	2
Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming	2
A Finitely Convergent Circumcenter Method for the Convex Feasibility Problem	2
The Derivatives of Sinkhorn–Knopp Converge	2
Affinely Adjustable Robust Linear Complementarity Problems	2
Approximation Guarantees for Min-Max-Min Robust Optimization and \({\boldsymbol{k}}\)-Adaptability Under Objective Uncertainty	2
Analysis of the SiMPL Method for Density-Based Topology Optimization	2
Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow	2
Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming	2
Moderate Deviations and Invariance Principles for Sample Average Approximations	2
A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization	2
Second-Order Subdifferential Optimality Conditions in Nonsmooth Optimization	2
Finding Sparse Solutions for Packing and Covering Semidefinite Programs	2
Derivative-Free Approaches for Chance-Constrained Problems with Right-Hand Side Uncertainty	2
A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions	2
Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm	2
Discrete Optimal Transport with Independent Marginals is #P-Hard	2
Accelerated Forward-Backward Optimization Using Deep Learning	2
Constraint Qualifications and Strong Global Convergence Properties of an Augmented Lagrangian Method on Riemannian Manifolds	2
A Quadratically Convergent Sequential Programming Method for Second-Order Cone Programs Capable of Warm Starts	2
Provably Faster Gradient Descent via Long Steps	2
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube	2
Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming	2
A Solution Method for Arbitrary Polyhedral Convex Set Optimization Problems	2
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates	2
Clarke’s Tangent Cones, Subgradients, Optimality Conditions, and the Lipschitzness at Infinity	2
Model Construction for Convex-Constrained Derivative-Free Optimization	2
Convergence Properties of Proximal (Sub)gradient Methods without Convexity or Smoothness of Any of the Functions	2
Convergence Rate of Random Scan Coordinate Ascent Variational Inference Under Log-Concavity	2
Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems	2
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems	2
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem	2
Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training	2
Simple and Optimal Methods for Stochastic Variational Inequalities, II: Markovian Noise and Policy Evaluation in Reinforcement Learning	2
Solving Moment and Polynomial Optimization Problems on Sobolev Spaces	1
Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming	1
Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual	1
Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming	1
The Stochastic Conjugate Subgradient Algorithm for Kernel Support Vector Machines	1
Generalized Power Cones: Optimal Error Bounds and Automorphisms	1
Bayesian Distributionally Robust Optimization	1
Geometric Characterizations of Lipschitz Stability for Convex Optimization Problems	1
Data-Driven Distributionally Robust Multiproduct Pricing Problems under Pure Characteristics Demand Models	1
DIMIX: Diminishing Mixing for Sloppy Agents	1
A Feasible Method for General Convex Low-Rank SDP Problems	1
Convergence of ZH-Type Nonmonotone Descent Method for Kurdyka–Łojasiewicz Optimization Problems	1
Sharper Bounds for Proximal Gradient Algorithms with Errors	1
Space Mapping for PDE Constrained Shape Optimization	1
Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory	1
Towards Global Solutions for Nonconvex Two-Stage Stochastic Programs: A Polynomial Lower Approximation Approach	1
Robust Markov Decision Processes with Data-Driven, Distance-Based Ambiguity Sets	1
Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds	1
Everything Is Possible: Constructing Spectrahedra with Prescribed Facial Dimensions	1
A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning	1
Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems	1
Exact Augmented Lagrangian Duality for Mixed Integer Convex Optimization	1
Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions	1
A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization	1
Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis	1
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization	1
Fréchet Second-Order Subdifferentials of Lagrangian Functions and Optimality Conditions	1
Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization	1
Faster Lagrangian-Based Methods in Convex Optimization	1
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization	1
Certifying the Absence of Spurious Local Minima at Infinity	1
Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality	1
Constrained Optimization in the Presence of Noise	1
Provably Accelerated Decentralized Gradient Methods Over Unbalanced Directed Graphs	1
On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization	1
Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities	1
Convex Optimization Problems on Differentiable Sets	1
Fast Optimization of Charged Particle Dynamics with Damping	1
Affine Invariant Convergence Rates of the Conditional Gradient Method	1
Stochastic Differential Equations for Modeling First Order Optimization Methods	1
Approximating Higher-Order Derivative Tensors Using Secant Updates	1
Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization	1
Maximal Monotonicity and Cyclic Involutivity of Multiconjugate Convex Functions	1
Model-Based Derivative-Free Methods for Convex-Constrained Optimization	1
A Variational Approach to Weakly Continuous Relations in Banach Spaces	1
A Nonparametric Robust Optimization Approach for Chance-Constrained Knapsack Problem	1
Fast Gradient Algorithm with Dry-like Friction and Nonmonotone Line Search for Nonconvex Optimization Problems	1
Adaptive Third-Order Methods for Composite Convex Optimization	1
A Functional Model Method for Nonconvex Nonsmooth Conditional Stochastic Optimization	1
Robust Accelerated Primal-Dual Methods for Computing Saddle Points	1
Convex Representatives of the Value Function and Aumann Integrals in Normed Spaces	1