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 2020-03-01 to 2024-03-01.)
ArticleCitations
Generalized Penalty and Regularization Method for Differential Variational-Hemivariational Inequalities70
Well-Posedness, Optimal Control, and Sensitivity Analysis for a Class of Differential Variational-Hemivariational Inequalities56
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity37
Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension36
Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization35
A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems28
Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation18
A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima17
Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem17
Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise17
Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods16
Variable Metric Forward-Backward Algorithm for Composite Minimization Problems15
Riemannian Optimization on the Symplectic Stiefel Manifold15
An Interior-Point Approach for Solving Risk-Averse PDE-Constrained Optimization Problems with Coherent Risk Measures15
A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints14
Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction14
On a Semismooth* Newton Method for Solving Generalized Equations14
Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization13
Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property13
A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints12
Riemannian Conjugate Gradient Methods: General Framework and Specific Algorithms with Convergence Analyses12
Stochastic Approximation for Optimization in Shape Spaces12
Nonlinear Forward-Backward Splitting with Projection Correction11
Generalized Newton Algorithms for Tilt-Stable Minimizers in Nonsmooth Optimization11
Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization11
Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems11
Faster Lagrangian-Based Methods in Convex Optimization10
Greedy Quasi-Newton Methods with Explicit Superlinear Convergence10
Generalized Momentum-Based Methods: A Hamiltonian Perspective10
Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure9
A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic9
An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems9
Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming9
A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization9
Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization9
Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs8
Distributed Variable Sample-Size Gradient-Response and Best-Response Schemes for Stochastic Nash Equilibrium Problems8
Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs8
Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation8
Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling8
Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems8
The Landweber Operator Approach to the Split Equality Problem7
Nonlinear Conjugate Gradient Methods for PDE Constrained Shape Optimization Based on Steklov--Poincaré-Type Metrics7
Distributionally Robust Partially Observable Markov Decision Process with Moment-Based Ambiguity7
Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization7
An SQP Method for Equality Constrained Optimization on Hilbert Manifolds7
ADMM-Type Methods for Generalized Nash Equilibrium Problems in Hilbert Spaces7
Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass7
Optimization under Rare Chance Constraints7
Anisotropic Diffusion in Consensus-Based Optimization on the Sphere7
MultiLevel Composite Stochastic Optimization via Nested Variance Reduction7
On the Intrinsic Core of Convex Cones in Real Linear Spaces7
The Computation of Approximate Generalized Feedback Nash Equilibria7
Mathematical Foundations of Distributionally Robust Multistage Optimization7
The Condition Number of Riemannian Approximation Problems7
Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization6
Affinely Adjustable Robust Linear Complementarity Problems6
Error Bounds and Singularity Degree in Semidefinite Programming6
The Ratio-Cut Polytope and K-Means Clustering6
A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization6
On the Linear Convergence of the Multimarginal Sinkhorn Algorithm6
Optimal Convergence Rates for the Proximal Bundle Method6
From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective6
Symmetry Reduction in AM/GM-Based Optimization6
Probabilistic Guarantees in Robust Optimization6
Existence Results for Generalized Nash Equilibrium Problems under Continuity-Like Properties of Sublevel Sets6
Local Convergence Analysis of Augmented Lagrangian Methods for Piecewise Linear-Quadratic Composite Optimization Problems6
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems6
On the Complexity of Inverse Mixed Integer Linear Optimization6
Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy5
Accelerated Iterative Regularization via Dual Diagonal Descent5
Split-Douglas--Rachford Algorithm for Composite Monotone Inclusions and Split-ADMM5
Distance-Sparsity Transference for Vertices of Corner Polyhedra5
Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization5
Stochastic Dynamic Linear Programming: A Sequential Sampling Algorithm for Multistage Stochastic Linear Programming5
Unified Acceleration of High-Order Algorithms under General Hölder Continuity5
Simple and Optimal Methods for Stochastic Variational Inequalities, II: Markovian Noise and Policy Evaluation in Reinforcement Learning5
Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support5
An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection5
On High-Order Multilevel Optimization Strategies5
A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes5
A Globally Convergent SQCQP Method for Multiobjective Optimization Problems5
Stochastic Multilevel Composition Optimization Algorithms with Level-Independent Convergence Rates5
Adaptive Sequential Sample Average Approximation for Solving Two-Stage Stochastic Linear Programs5
Condition Number Minimization in Euclidean Jordan Algebras5
Golden Ratio Primal-Dual Algorithm with Linesearch5
Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph4
Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence4
Degenerate Preconditioned Proximal Point Algorithms4
A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization4
Fenchel Duality and a Separation Theorem on Hadamard Manifolds4
Convergence of Newton-MR under Inexact Hessian Information4
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization4
Randomized Sketching Algorithms for Low-Memory Dynamic Optimization4
A Derivative-Free Method for Structured Optimization Problems4
Generalized Leibniz Rules and Lipschitzian Stability for Expected-Integral Mappings4
A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization4
Exact Penalty Function for $\ell_{2,1}$ Norm Minimization over the Stiefel Manifold4
An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity4
Stochastic Decomposition Method for Two-Stage Distributionally Robust Linear Optimization4
Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions4
Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds4
Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices4
Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method4
Distributionally Robust Two-Stage Stochastic Programming4
Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method4
Sketched Newton--Raphson4
Constrained Consensus-Based Optimization4
Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel3
Optimal Self-Concordant Barriers for Quantum Relative Entropies3
Making the Last Iterate of SGD Information Theoretically Optimal3
An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization3
Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function3
Stochastic Approximation Methods for the Two-Stage Stochastic Linear Complementarity Problem3
Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts3
Zeroth-Order Stochastic Compositional Algorithms for Risk-Aware Learning3
Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming3
Convergence Rates of the Heavy Ball Method for Quasi-strongly Convex Optimization3
An Optimal Algorithm for Decentralized Finite-Sum Optimization3
The Generalized Bregman Distance3
Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant3
Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions3
Attouch--Théra Duality, Generalized Cycles, and Gap Vectors3
Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization3
An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems3
Variational Analysis in Normed Spaces with Applications to Constrained Optimization3
Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections3
Amenable Cones Are Particularly Nice3
Exact Semidefinite Programming Bounds for Packing Problems3
Space Mapping for PDE Constrained Shape Optimization3
Effective Scenarios in Multistage Distributionally Robust Optimization with a Focus on Total Variation Distance3
Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients2
A Vectorization Scheme for Nonconvex Set Optimization Problems2
A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer2
High-Order Optimization Methods for Fully Composite Problems2
The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem2
Tikhonov Regularization of a Perturbed Heavy Ball System with Vanishing Damping2
Genericity Analysis of Multi-Leader-Disjoint-Followers Game2
On the Convergence of Stochastic Primal-Dual Hybrid Gradient2
Adaptive Douglas--Rachford Splitting Algorithm from a Yosida Approximation Standpoint2
Certifying the Absence of Spurious Local Minima at Infinity2
The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces2
Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization2
Linearly Constrained Nonsmooth Optimization for Training Autoencoders2
Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality2
Differentially Private Accelerated Optimization Algorithms2
Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search2
Optimality Conditions for Convex Stochastic Optimization Problems in Banach Spaces with Almost Sure State Constraints2
The Bregman Proximal Average2
Convexification with Bounded Gap for Randomly Projected Quadratic Optimization2
Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis2
Preference Robust Optimization for Choice Functions on the Space of CDFs2
A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones2
A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering2
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 Intersection2
Model-Based Derivative-Free Methods for Convex-Constrained Optimization2
New First-Order Algorithms for Stochastic Variational Inequalities2
Horizon Maps and Graphical Convergence Revisited2
On the Divergence of Decentralized Nonconvex Optimization2
Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces2
Fundamental Domains for Symmetric Optimization: Construction and Search2
Square-Root Metric Regularity and Related Stability Theorems for Smooth Mappings2
On the Benefit of Width for Neural Networks: Disappearance of Basins2
MG/OPT and Multilevel Monte Carlo for Robust Optimization of PDEs2
Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints2
Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling2
The Structure of Conservative Gradient Fields2
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search2
Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization2
On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints2
Distributionally Robust Second-Order Stochastic Dominance Constrained Optimization with Wasserstein Ball2
Corrigendum: Critical Cones for Sufficient Second Order Conditions in PDE Constrained Optimization2
Dual Space Preconditioning for Gradient Descent2
A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems2
Escaping Unknown Discontinuous Regions in Blackbox Optimization2
Split Cuts in the Plane2
Bayesian Optimization with Expensive Integrands2
Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints2
Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials2
On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems2
Robust Markov Decision Processes with Data-Driven, Distance-Based Ambiguity Sets2
A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees1
Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations1
Algorithms to Solve Unbounded Convex Vector Optimization Problems1
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints1
Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management1
First-Order Algorithms for a Class of Fractional Optimization Problems1
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems1
Mini-Batch Risk Forms1
DIMIX: Diminishing Mixing for Sloppy Agents1
Strong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) Spaces1
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity1
Stochastic Saddle Point Problems with Decision-Dependent Distributions1
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations1
An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications1
Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence1
Dynamic Stochastic Variational Inequalities and Convergence of Discrete Approximation1
Generic Property of the Partial Calmness Condition for Bilevel Programming Problems1
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems1
Existence of Solutions for Deterministic Bilevel Games under a General Bayesian Approach1
Cutting Plane Generation through Sparse Principal Component Analysis1
Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems1
Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming1
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube1
Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables1
On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization1
Bayesian Distributionally Robust Optimization1
Nonlinear Gradient Mappings and Stochastic Optimization: A General Framework with Applications to Heavy-Tail Noise1
Newton Differentiability of Convex Functions in Normed Spaces and of a Class of Operators1
Continuation Methods for Riemannian Optimization1
Performance Bounds for PDE-Constrained Optimization under Uncertainty1
Sublinear Convergence of a Tamed Stochastic Gradient Descent Method in Hilbert Space1
Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions1
Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming1
Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning1
Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization1
Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems1
Shortest Paths in Graphs of Convex Sets1
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets1
A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints1
Quadratic Growth and Strong Metric Subregularity of the Subdifferential via Subgradient Graphical Derivative1
Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems1
Rational Generalized Nash Equilibrium Problems1
Optimization of Stochastic Blackboxes with Adaptive Precision1
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates1
Convex Optimization Problems on Differentiable Sets1
Partial Smoothness and Constant Rank1
Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities1
Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory1
A Simplex Method for Countably Infinite Linear Programs1
A Newton Algorithm for Semidiscrete Optimal Transport with Storage Fees1
Variational Convexity of Functions and Variational Sufficiency in Optimization1
Continuous Newton-like Methods Featuring Inertia and Variable Mass1
Random Coordinate Descent Methods for Nonseparable Composite Optimization1
A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization1
Perturbation Analysis of Metric Subregularity for Multifunctions1
An Improved Unconstrained Approach for Bilevel Optimization1
First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems1
Existence and Approximation of Continuous Bayesian Nash Equilibria in Games with Continuous Type and Action Spaces1
Relative Lipschitz-like Property of Parametric Systems via Projectional Coderivatives1
Openness, Hölder Metric Regularity, and Hölder Continuity Properties of Semialgebraic Set-Valued Maps1
0.025866985321045