SIAM Journal on Optimization

Papers
(The median citation count of SIAM Journal on Optimization is 1. 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-02-01 to 2025-02-01.)
ArticleCitations
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity30
Improving the Global Convergence of Inexact Restoration Methods for Constrained Optimization Problems27
A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering20
Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function18
On Integrality in Semidefinite Programming for Discrete Optimization17
Nonasymptotic Upper Estimates for Errors of the Sample Average Approximation Method to Solve Risk-Averse Stochastic Programs15
Corrigendum: Critical Cones for Sufficient Second Order Conditions in PDE Constrained Optimization15
Stochastic Trust-Region and Direct-Search Methods: A Weak Tail Bound Condition and Reduced Sample Sizing11
Vector Asymptotic Functions and Their Application to Multiobjective Optimization Problems11
Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence11
Parameter-Free Accelerated Gradient Descent for Nonconvex Minimization10
Reducing Nonnegativity over General Semialgebraic Sets to Nonnegativity over Simple Sets10
Occupation Measure Relaxations in Variational Problems: The Role of Convexity10
On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials10
QNG: A Quasi-Natural Gradient Method for Large-Scale Statistical Learning9
A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning9
Harmonic Hierarchies for Polynomial Optimization9
On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints9
Towards Global Solutions for Nonconvex Two-Stage Stochastic Programs: A Polynomial Lower Approximation Approach8
Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming8
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective8
PCA Sparsified8
Square Root LASSO: Well-Posedness, Lipschitz Stability, and the Tuning Trade-Off8
Bayesian Joint Chance Constrained Optimization: Approximations and Statistical Consistency8
Performance Bounds for PDE-Constrained Optimization under Uncertainty8
High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles7
Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound7
On Minimal Extended Representations of Generalized Power Cones7
Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games7
A Descent Algorithm for the Optimal Control of ReLU Neural Network Informed PDEs Based on Approximate Directional Derivatives7
The Computation of Approximate Generalized Feedback Nash Equilibria7
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization7
Min-Max-Min Optimization with Smooth and Strongly Convex Objectives6
Stochastic Decomposition Method for Two-Stage Distributionally Robust Linear Optimization6
Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality6
Convergence Rates of the Heavy Ball Method for Quasi-strongly Convex Optimization6
Bayesian Stochastic Gradient Descent for Stochastic Optimization with Streaming Input Data6
Random Coordinate Descent Methods for Nonseparable Composite Optimization6
Constrained Consensus-Based Optimization6
Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions6
DIMIX: Diminishing Mixing for Sloppy Agents5
A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization5
Symmetry Reduction in AM/GM-Based Optimization5
Corrigendum and Addendum: Newton Differentiability of Convex Functions in Normed Spaces and of a Class of Operators5
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations5
Minimum Spanning Trees in Infinite Graphs: Theory and Algorithms5
Optimal Self-Concordant Barriers for Quantum Relative Entropies5
Stability Properties for Parametric Linear Programs under Data Ambiguities5
Variational Convexity of Functions and Variational Sufficiency in Optimization5
Sketched Newton--Raphson5
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization5
A Riemannian Proximal Newton Method5
Model-Based Derivative-Free Methods for Convex-Constrained Optimization5
Subgradient Sampling for Nonsmooth Nonconvex Minimization4
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search4
Nonlinear Gradient Mappings and Stochastic Optimization: A General Framework with Applications to Heavy-Tail Noise4
Fenchel Duality and a Separation Theorem on Hadamard Manifolds4
Stochastic Multilevel Composition Optimization Algorithms with Level-Independent Convergence Rates4
Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation4
Harnessing Structure in Composite Nonsmooth Minimization4
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube4
Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory4
A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds4
A Sequential Quadratic Programming Method With High-Probability Complexity Bounds for Nonlinear Equality-Constrained Stochastic Optimization4
Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints4
Moderate Deviations and Invariance Principles for Sample Average Approximations4
Optimal Convergence Rates for the Proximal Bundle Method4
Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning4
An Unbiased Approach to Low Rank Recovery3
Convexification with Bounded Gap for Randomly Projected Quadratic Optimization3
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods3
Sequential Quadratic Optimization for Stochastic Optimization with Deterministic Nonlinear Inequality and Equality Constraints3
Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part II: Outer Approximation Algorithm3
On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms3
Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization3
Optimal Methods for Convex Risk-Averse Distributed Optimization3
Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal3
The Ratio-Cut Polytope and K-Means Clustering3
Derivative-Free Approaches for Chance-Constrained Problems with Right-Hand Side Uncertainty3
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems3
The Bregman Proximal Average3
Derivative-Free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems3
Time Consistency for Multistage Stochastic Optimization Problems under Constraints in Expectation3
Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow3
Convex Representatives of the Value Function and Aumann Integrals in Normed Spaces3
From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective3
Convergence Rate of Random Scan Coordinate Ascent Variational Inference Under Log-Concavity3
Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm3
Cyclic Coordinate Dual Averaging with Extrapolation3
Accelerated Forward-Backward Optimization Using Deep Learning3
Fenchel–Young Inequality with a Remainder and Applications to Convex Duality and Optimal Transport3
First-Order Algorithms for a Class of Fractional Optimization Problems3
A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer2
Distributionally Robust Two-Stage Stochastic Programming2
Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem2
Solution of Mismatched Monotone+Lipschitz Inclusion Problems2
Provably Faster Gradient Descent via Long Steps2
Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity2
Constrained Optimization in the Presence of Noise2
Robust Markov Decision Processes with Data-Driven, Distance-Based Ambiguity Sets2
Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems2
Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency2
Optimal Algorithms for Stochastic Complementary Composite Minimization2
Approximation Guarantees for Min-Max-Min Robust Optimization and \({\boldsymbol{k}}\)-Adaptability Under Objective Uncertainty2
Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming2
Constraint Qualifications and Strong Global Convergence Properties of an Augmented Lagrangian Method on Riemannian Manifolds2
Stochastic Trust-Region Algorithm in Random Subspaces with Convergence and Expected Complexity Analyses2
Basic Convex Analysis in Metric Spaces with Bounded Curvature2
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems2
An Improved Unconstrained Approach for Bilevel Optimization2
Linear Programming on the Stiefel Manifold2
Adaptive Third-Order Methods for Composite Convex Optimization2
Newton Differentiability of Convex Functions in Normed Spaces and of a Class of Operators2
Partial Smoothness and Constant Rank2
Convergence Rate Analysis of a Dykstra-Type Projection Algorithm2
Accelerated Minimax Algorithms Flock Together2
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems2
Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation2
A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions2
MIP Relaxations in Factorable Programming2
Differentially Private Accelerated Optimization Algorithms2
Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients2
Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part I: Convex Relaxations2
On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization2
Decomposition Methods for Global Solution of Mixed-Integer Linear Programs2
On a Differential Generalized Nash Equilibrium Problem with Mean Field Interaction2
The Computation of Approximate Feedback Stackelberg Equilibria in Multiplayer Nonlinear Constrained Dynamic Games2
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates2
The Rate of Convergence of Bregman Proximal Methods: Local Geometry Versus Regularity Versus Sharpness2
Generalized Power Cones: Optimal Error Bounds and Automorphisms2
Preference Robust Optimization for Choice Functions on the Space of CDFs2
Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming2
Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty2
Stochastic Differential Equations for Modeling First Order Optimization Methods2
Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization2
A Path-Based Approach to Constrained Sparse Optimization2
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints2
Dual Descent Augmented Lagrangian Method and Alternating Direction Method of Multipliers2
Super-Universal Regularized Newton Method2
A Family of \(\boldsymbol{s}\)-Rectangular Robust MDPs: Relative Conservativeness, Asymptotic Analyses, and Finite-Sample Properties2
Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy1
Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual1
Rational Generalized Nash Equilibrium Problems1
Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature1
Openness, Hölder Metric Regularity, and Hölder Continuity Properties of Semialgebraic Set-Valued Maps1
Block Policy Mirror Descent1
Affinely Adjustable Robust Linear Complementarity Problems1
Space Mapping for PDE Constrained Shape Optimization1
Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions1
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization1
Understanding a Class of Decentralized and Federated Optimization Algorithms: A Multirate Feedback Control Perspective1
Adaptive Consensus: A Network Pruning Approach for Decentralized Optimization1
A Unified Framework for Pricing in Nonconvex Resource Allocation Games1
Bias Reduction in Sample-Based Optimization1
A Finitely Convergent Circumcenter Method for the Convex Feasibility Problem1
Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence1
Finding Sparse Solutions for Packing and Covering Semidefinite Programs1
Convergent Algorithms for a Class of Convex Semi-infinite Programs1
The Geometry of Sparse Analysis Regularization1
Evolution of Mixed Strategies in Monotone Games1
A Quadratically Convergent Sequential Programming Method for Second-Order Cone Programs Capable of Warm Starts1
Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization1
Fast Optimization of Charged Particle Dynamics with Damping1
Existence of Solutions for Deterministic Bilevel Games under a General Bayesian Approach1
Escaping Unknown Discontinuous Regions in Blackbox Optimization1
Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming1
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets1
Zeroth-Order Stochastic Compositional Algorithms for Risk-Aware Learning1
Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming1
Shape Optimization for Variational Inequalities: The Scalar Tresca Friction Problem1
Generic Property of the Partial Calmness Condition for Bilevel Programming Problems1
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients1
A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization1
Finite Convergence of Moment-SOS Relaxations with Nonreal Radical Ideals1
Discrete Optimal Transport with Independent Marginals is #P-Hard1
Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation1
Universal Conditional Gradient Sliding for Convex Optimization1
Degenerate Preconditioned Proximal Point Algorithms1
Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel1
Certifying the Absence of Spurious Local Minima at Infinity1
Using Taylor-Approximated Gradients to Improve the Frank–Wolfe Method for Empirical Risk Minimization1
The Derivatives of Sinkhorn–Knopp Converge1
Affine Invariant Convergence Rates of the Conditional Gradient Method1
Optimization on the Euclidean Unit Sphere1
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem1
A Novel Nonconvex Relaxation Approach to Low-Rank Matrix Completion of Inexact Observed Data1
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs1
A Feasible Method for General Convex Low-Rank SDP Problems1
Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems1
On Conditional Risk Assessments in Scenario Optimization1
On the Benefit of Width for Neural Networks: Disappearance of Basins1
Effective Scenarios in Multistage Distributionally Robust Optimization with a Focus on Total Variation Distance1
Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization1
Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity1
Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training1
Variational and Strong Variational Convexity in Infinite-Dimensional Variational Analysis1
Simple and Optimal Methods for Stochastic Variational Inequalities, II: Markovian Noise and Policy Evaluation in Reinforcement Learning1
Superlinear Convergence of a Semismooth Newton Method for Some Optimization Problems with Applications to Control Theory1
Complexity of Finite-Sum Optimization with Nonsmooth Composite Functions and Non-Lipschitz Regularization1
A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems1
Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization1
A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems1
Corrigendum: Convex Optimization Problems on Differentiable Sets1
Convergence Analysis of a Norm Minimization-Based Convex Vector Optimization Algorithm1
Convergence Analyses of Davis–Yin Splitting via Scaled Relative Graphs1
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints1
Strongly Nonexpansive Mappings Revisited: Uniform Monotonicity and Operator Splitting1
A Functional Model Method for Nonconvex Nonsmooth Conditional Stochastic Optimization1
Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming1
Scalable Frank–Wolfe on Generalized Self-Concordant Functions via Simple Steps1
0.02928900718689