On the public citation graph
Acceleration Methods
0 signed · 203 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nla.617openalex-snapshot
Two classes of multisecant methods for nonlinear acceleration
inferredcites →https://doi.org/10.1007/978-3-663-11108-5openalex-snapshot
Polynomial Based Iteration Methods for Symmetric Linear Systems
inferredcites →https://doi.org/10.1007/bf01386013openalex-snapshot
Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods
inferredcites →https://doi.org/10.1007/bf01386014openalex-snapshot
Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods
inferredcites →https://doi.org/10.1007/bf01580138openalex-snapshot
A dual approach to solving nonlinear programming problems by unconstrained optimization
inferredcites →https://doi.org/10.1007/bf01581275openalex-snapshot
A nonsmooth version of Newton's method
inferredcites →https://doi.org/10.1007/bf02575753openalex-snapshot
Generalisations de la transformation de shanks, de la table de Pade et de l'ε-algorithme
inferredcites →https://doi.org/10.1007/s002110050110openalex-snapshot
Analysis of some vector extrapolation methods for solving systems of linear equations
inferredcites →https://doi.org/10.1007/s10107-004-0552-5openalex-snapshot
Smooth minimization of non-smooth functions
inferredcites →https://doi.org/10.1007/s10107-006-0089-xopenalex-snapshot
Accelerating the cubic regularization of Newton’s method on convex problems
inferredcites →https://doi.org/10.1007/s10107-006-0706-8openalex-snapshot
Cubic regularization of Newton method and its global performance
inferredcites →https://doi.org/10.1007/s10107-007-0149-xopenalex-snapshot
Primal-dual subgradient methods for convex problems
inferredcites →https://doi.org/10.1007/s10107-008-0261-6openalex-snapshot
Primal-dual first-order methods with $${\mathcal {O}(1/\epsilon)}$$ iteration-complexity for cone programming
inferredcites →https://doi.org/10.1007/s10107-010-0394-2openalex-snapshot
Approximation accuracy, gradient methods, and error bound for structured convex optimization
inferredcites →https://doi.org/10.1007/s10107-010-0434-yopenalex-snapshot
An optimal method for stochastic composite optimization
inferredcites →https://doi.org/10.1007/s10107-012-0528-9openalex-snapshot
A practical relative error criterion for augmented Lagrangians
inferredcites →https://doi.org/10.1007/s10107-012-0629-5openalex-snapshot
Gradient methods for minimizing composite functions
inferredcites →https://doi.org/10.1007/s10107-013-0653-0openalex-snapshot
Performance of first-order methods for smooth convex minimization: a novel approach
inferredcites →https://doi.org/10.1007/s10107-013-0677-5openalex-snapshot
First-order methods of smooth convex optimization with inexact oracle
inferredcites →https://doi.org/10.1007/s10107-014-0790-0openalex-snapshot
Universal gradient methods for convex optimization problems
inferredcites →https://doi.org/10.1007/s10107-015-0949-3openalex-snapshot
Optimized first-order methods for smooth convex minimization
inferredcites →https://doi.org/10.1007/s10107-016-0985-7openalex-snapshot
An optimal variant of Kelley’s cutting-plane method
inferredcites →https://doi.org/10.1007/s10107-016-0992-8openalex-snapshot
Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
inferredcites →https://doi.org/10.1007/s10107-016-1009-3openalex-snapshot
Smooth strongly convex interpolation and exact worst-case performance of first-order methods
inferredcites →https://doi.org/10.1007/s10107-016-1030-6openalex-snapshot
Minimizing finite sums with the stochastic average gradient
inferredcites →https://doi.org/10.1007/s10107-016-1091-6openalex-snapshot
From error bounds to the complexity of first-order descent methods for convex functions
inferredcites →https://doi.org/10.1007/s10107-018-1232-1openalex-snapshot
Linear convergence of first order methods for non-strongly convex optimization
inferredcites →https://doi.org/10.1007/s10107-018-1284-2openalex-snapshot
A simplified view of first order methods for optimization
inferredcites →https://doi.org/10.1007/s10107-019-01410-2openalex-snapshot
Efficient first-order methods for convex minimization: a constructive approach
inferredcites →https://doi.org/10.1007/s10107-020-01486-1openalex-snapshot
Analysis of biased stochastic gradient descent using sequential semidefinite programs
inferredcites →https://doi.org/10.1007/s101070050022openalex-snapshot
Error bounds for proximal point subproblems and associated inexact proximal point algorithms
inferredcites →https://doi.org/10.1007/s10208-013-9150-3openalex-snapshot
Adaptive Restart for Accelerated Gradient Schemes
inferredcites →https://doi.org/10.1007/s10208-014-9189-9openalex-snapshot
Fast First-Order Methods for Composite Convex Optimization with Backtracking
inferredcites →https://doi.org/10.1007/s10208-017-9366-8openalex-snapshot
Calculus of the Exponent of Kurdyka–Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods
inferredcites →https://doi.org/10.1007/s10444-016-9481-0openalex-snapshot
Minimal polynomial and reduced rank extrapolation methods are related
inferredcites →https://doi.org/10.1007/s10589-021-00273-8openalex-snapshot
Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
inferredcites →https://doi.org/10.1007/s10957-014-0677-5openalex-snapshot
Quasi-monotone Subgradient Methods for Nonsmooth Convex Minimization
inferredcites →https://doi.org/10.1007/s10957-016-0999-6openalex-snapshot
Stochastic Intermediate Gradient Method for Convex Problems with Stochastic Inexact Oracle
inferredcites →https://doi.org/10.1007/s10957-016-1018-7openalex-snapshot
On the Convergence Analysis of the Optimized Gradient Method
inferredcites →https://doi.org/10.1007/s10957-018-1287-4openalex-snapshot
Adaptive Restart of the Optimized Gradient Method for Convex Optimization
inferredcites →https://doi.org/10.1007/s10957-018-1298-1openalex-snapshot
Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization
inferredcites →https://doi.org/10.1007/s10957-019-01601-zopenalex-snapshot
Finding the Forward-Douglas–Rachford-Forward Method
inferredcites →https://doi.org/10.1007/s11075-018-0567-2openalex-snapshot
The genesis and early developments of Aitken’s process, Shanks’ transformation, the ε–algorithm, and related fixed point methods
inferredcites →https://doi.org/10.1007/s11590-016-1087-4openalex-snapshot
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
inferredcites →https://doi.org/10.1007/s11590-020-01617-9openalex-snapshot
On the convergence rate of the Halpern-iteration
inferredcites →https://doi.org/10.1007/s12532-011-0029-5openalex-snapshot
Templates for convex cone problems with applications to sparse signal recovery
inferredcites →https://doi.org/10.1016/0022-247x(79)90234-8openalex-snapshot
Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
inferredcites →https://doi.org/10.1016/0041-5553(85)90100-4openalex-snapshot
Optimal methods of smooth convex minimization
inferredcites →https://doi.org/10.1016/0045-7825(77)90004-4openalex-snapshot
Convergence acceleration for the iterative solution of the equations X = AX + f
inferredcites →https://doi.org/10.1016/0168-9274(88)90011-6openalex-snapshot
Recursive algorithms for vector extrapolation methods
inferredcites →https://doi.org/10.1016/0377-0427(88)90287-7openalex-snapshot
Convergence and stability analyses for some vector extrapolation methods in the presence of defective iteration matrices
inferredcites →https://doi.org/10.1016/0377-0427(88)90289-0openalex-snapshot
Extrapolation vs. projection methods for linear systems of equations
inferredcites →https://doi.org/10.1016/0377-0427(91)90013-aopenalex-snapshot
Efficient implementation of minimal polynomial and reduced rank extrapolation methods
inferredcites →https://doi.org/10.1016/0377-0427(91)90018-fopenalex-snapshot
Some results about vector extrapolation methods and related fixed-point iterations
inferredcites →https://doi.org/10.1016/0885-064x(91)90001-eopenalex-snapshot
On optimality of Krylov's information when solving linear operator equations
inferredcites →https://doi.org/10.1016/0885-064x(92)90013-2openalex-snapshot
Information-based complexity of linear operator equations
inferredcites →https://doi.org/10.1016/b978-0-12-734250-4.50028-xopenalex-snapshot
EXTRAPOLATING TO THE LIMIT OF A VECTOR SEQUENCE11This research was carried out under the Mathematical Sciences Research Program, Task Area SR0140301 (Math Sciences), supported by the Naval Sea Systems Command.
inferredcites →https://doi.org/10.1016/b978-0-444-50617-7.50006-9openalex-snapshot
Convergence acceleration during the 20th century
inferredcites →https://doi.org/10.1016/j.camwa.2007.11.027openalex-snapshot
Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations
inferredcites →https://doi.org/10.1016/j.jco.2014.08.003openalex-snapshot
On lower complexity bounds for large-scale smooth convex optimization
inferredcites →https://doi.org/10.1016/j.jco.2016.11.001openalex-snapshot
The exact information-based complexity of smooth convex minimization
inferredcites →https://doi.org/10.1016/s0167-6377(02)00231-6openalex-snapshot
Mirror descent and nonlinear projected subgradient methods for convex optimization
inferredcites →https://doi.org/10.1016/s0167-8191(01)00139-9openalex-snapshot
The Chebyshev iteration revisited
inferredcites →https://doi.org/10.1016/s0168-9274(98)00098-1openalex-snapshot
Applications of semidefinite programming
inferredcites →https://doi.org/10.1016/s0377-0427(00)00357-5openalex-snapshot
Vector extrapolation methods. Applications and numerical comparison
inferredcites →https://doi.org/10.1017/cbo9780511801181openalex-snapshot
An Introduction to Numerical Analysis
inferredcites →https://doi.org/10.1017/s096249291600009xopenalex-snapshot
An introduction to continuous optimization for imaging
inferredcites →https://doi.org/10.1023/a:1008777829180openalex-snapshot
A Hybrid Approximate Extragradient – Proximal Point Algorithm Using the Enlargement of a Maximal Monotone Operator
inferredcites →https://doi.org/10.1023/a:1019113314010openalex-snapshot
Upper bounds for convergence rates of acceleration methods with initial iterations
inferredcites →https://doi.org/10.1063/1.1699598openalex-snapshot
Numerical Determination of Fundamental Modes
inferredcites →https://doi.org/10.1073/pnas.1614734113openalex-snapshot
A variational perspective on accelerated methods in optimization
inferredcites →https://doi.org/10.1081/nfa-100108320openalex-snapshot
A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS *
inferredcites →https://doi.org/10.1090/s0002-9947-1956-0084194-4openalex-snapshot
On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
inferredcites →https://doi.org/10.1090/s0025-5718-1972-0314226-xopenalex-snapshot
On the Solution of Systems of Equations by the Epsilon Algorithm of Wynn
inferredcites →https://doi.org/10.1109/9.587335openalex-snapshot
System analysis via integral quadratic constraints
inferredcites →https://doi.org/10.1109/cdc42340.2020.9304444openalex-snapshot
High-Resolution Modeling of the Fastest First-Order Optimization Method for Strongly Convex Functions
inferredcites →https://doi.org/10.1109/cdc45484.2021.9683505openalex-snapshot
Automated Worst-Case Performance Analysis of Decentralized Gradient Descent
inferredcites →https://doi.org/10.1109/icmla.2017.00-43openalex-snapshot
Better Worst-Case Complexity Analysis of the Block Coordinate Descent Method for Large Scale Machine Learning
inferredcites →https://doi.org/10.1109/lcsys.2017.2722406openalex-snapshot
The Fastest Known Globally Convergent First-Order Method for Minimizing Strongly Convex Functions
inferredcites →https://doi.org/10.1109/mcse.2011.71openalex-snapshot
The Numerical Tours of Signal Processing
inferredcites →https://doi.org/10.1109/msp.2019.2943645openalex-snapshot
Optimization Methods for Magnetic Resonance Image Reconstruction: Key Models and Optimization Algorithms
inferredcites →https://doi.org/10.1109/tcns.2020.2988009openalex-snapshot
Analysis and Design of First-Order Distributed Optimization Algorithms Over Time-Varying Graphs
inferredcites →https://doi.org/10.1109/tip.2009.2028250openalex-snapshot
Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
inferredcites →https://doi.org/10.1109/tsp.2018.2866409openalex-snapshot
An Accelerated Composite Gradient Method for Large-Scale Composite Objective Problems
inferredcites →https://doi.org/10.1109/tsp.2020.2988614openalex-snapshot
A Generalized Accelerated Composite Gradient Method: Uniting Nesterov's Fast Gradient Method and FISTA
inferredcites →https://doi.org/10.1134/s0965542518010050openalex-snapshot
Universal Method for Stochastic Composite Optimization Problems
inferredcites →https://doi.org/10.1137/0315061openalex-snapshot
Semismooth and Semiconvex Functions in Constrained Optimization
inferredcites →https://doi.org/10.1137/0329022openalex-snapshot
On the Convergence of the Proximal Point Algorithm for Convex Minimization
inferredcites →https://doi.org/10.1137/0330025openalex-snapshot
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
inferredcites →https://doi.org/10.1137/050644641openalex-snapshot
The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
inferredcites →https://doi.org/10.1137/060676386openalex-snapshot
Smooth Optimization with Approximate Gradient
inferredcites →https://doi.org/10.1137/070704277openalex-snapshot
Robust Stochastic Approximation Approach to Stochastic Programming
inferredcites →https://doi.org/10.1137/0712047openalex-snapshot
Solution of Sparse Indefinite Systems of Linear Equations
inferredcites →https://doi.org/10.1137/0713060openalex-snapshot
A Polynomial Extrapolation Method for Finding Limits and Antilimits of Vector Sequences
inferredcites →https://doi.org/10.1137/0716071openalex-snapshot
Splitting Algorithms for the Sum of Two Nonlinear Operators
inferredcites →https://doi.org/10.1137/0723013openalex-snapshot
Acceleration of Convergence of Vector Sequences
inferredcites →https://doi.org/10.1137/0723014openalex-snapshot
Convergence and Stability Properties of Minimal Polynomial and Reduced Rank Extrapolation Algorithms
inferredcites →https://doi.org/10.1137/0802032openalex-snapshot
New Proximal Point Algorithms for Convex Minimization
inferredcites →https://doi.org/10.1137/080716542openalex-snapshot
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
inferredcites →https://doi.org/10.1137/0907058openalex-snapshot
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1137/1.9781611974966openalex-snapshot
Vector Extrapolation Methods with Applications
inferredcites →https://doi.org/10.1137/10078356xopenalex-snapshot
Anderson Acceleration for Fixed-Point Iterations
inferredcites →https://doi.org/10.1137/100802001openalex-snapshot
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
inferredcites →https://doi.org/10.1137/1029042openalex-snapshot
Extrapolation Methods for Vector Sequences
inferredcites →https://doi.org/10.1137/110833786openalex-snapshot
An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
inferredcites →https://doi.org/10.1137/110844805openalex-snapshot
Accelerated and Inexact Forward-Backward Algorithms
inferredcites →https://doi.org/10.1137/130919398openalex-snapshot
Convergence Analysis for Anderson Acceleration
inferredcites →https://doi.org/10.1137/130949993openalex-snapshot
Accelerated, Parallel, and Proximal Coordinate Descent
inferredcites →https://doi.org/10.1137/140957639openalex-snapshot
Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
inferredcites →https://doi.org/10.1137/15m1009597openalex-snapshot
Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
inferredcites →https://doi.org/10.1137/16m1060182openalex-snapshot
Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems
inferredcites →https://doi.org/10.1137/16m1072528openalex-snapshot
An Optimal First Order Method Based on Optimal Quadratic Averaging
inferredcites →https://doi.org/10.1137/16m108104xopenalex-snapshot
Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
inferredcites →https://doi.org/10.1137/16m108940xopenalex-snapshot
Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA)
inferredcites →https://doi.org/10.1137/16m1099546openalex-snapshot
Relatively Smooth Convex Optimization by First-Order Methods, and Applications
inferredcites →https://doi.org/10.1137/17m1116842openalex-snapshot
Optimal Affine-Invariant Smooth Minimization Algorithms
inferredcites →https://doi.org/10.1137/17m1120725openalex-snapshot
Shanks Sequence Transformations and Anderson Acceleration
inferredcites →https://doi.org/10.1137/17m112124xopenalex-snapshot
Generalizing the Optimized Gradient Method for Smooth Convex Minimization
inferredcites →https://doi.org/10.1137/17m1136845openalex-snapshot
Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problems
inferredcites →https://doi.org/10.1137/17m1149390openalex-snapshot
Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives
inferredcites →https://doi.org/10.1137/18m1172314openalex-snapshot
The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods
inferredcites →https://doi.org/10.1137/19m1244925openalex-snapshot
Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions
inferredcites →https://doi.org/10.1137/19m1281368openalex-snapshot
Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation
inferredcites →https://doi.org/10.1137/19m1299049openalex-snapshot
Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems
inferredcites →https://doi.org/10.1137/19m1304854openalex-snapshot
Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection
inferredcites →https://doi.org/10.1137/20m1364138openalex-snapshot
The Connections Between Lyapunov Functions for Some Optimization Algorithms and Differential Equations
inferredcites →https://doi.org/10.1137/s1052623403427823openalex-snapshot
Interior Gradient and Proximal Methods for Convex and Conic Optimization
inferredcites →https://doi.org/10.1137/s1052623494267127openalex-snapshot
Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
inferredcites →https://doi.org/10.1145/321296.321305openalex-snapshot
Iterative Procedures for Nonlinear Integral Equations
inferredcites →https://doi.org/10.1214/10-ssy010openalex-snapshot
Deterministic and Stochastic Primal-Dual Subgradient Algorithms for Uniformly Convex Minimization
inferredcites →https://doi.org/10.1287/moor.1.2.97openalex-snapshot
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
inferredcites →https://doi.org/10.1287/moor.12.3.474openalex-snapshot
A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem
inferredcites →https://doi.org/10.1287/moor.2016.0817openalex-snapshot
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
inferredcites →https://doi.org/10.1561/2200000016openalex-snapshot
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
inferredcites →https://doi.org/10.1561/2200000050openalex-snapshot
Convex Optimization: Algorithms and Complexity
inferredcites →https://doi.org/10.2140/pjm.1966.16.1openalex-snapshot
Minimization of functions having Lipschitz continuous first partial derivatives
inferredcites →https://doi.org/10.2307/2002183openalex-snapshot
On a Device for Computing the e m (S n ) Transformation
inferredcites →https://doi.org/10.23919/acc.2018.8430824openalex-snapshot
A Robust Accelerated Optimization Algorithm for Strongly Convex Functions
inferredcites →https://doi.org/10.23919/acc45564.2020.9147401openalex-snapshot
Direct Synthesis of Iterative Algorithms With Bounds on Achievable Worst-Case Convergence Rate
inferredcites →https://doi.org/10.24033/bsmf.1625openalex-snapshot
Proximité et dualité dans un espace hilbertien
inferredcites →https://doi.org/10.5802/aif.1638openalex-snapshot
On gradients of functions definable in o-minimal structures
inferredcites →https://doi.org/10.6028/jres.049.044openalex-snapshot
Methods of conjugate gradients for solving linear systems
inferredcites →https://doi.org/10.7551/mitpress/8996.003.0007openalex-snapshot
First-Order Methods for Nonsmooth Convex Large-Scale Optimization, I: General Purpose Methods
inferredcites →https://doi.org/10.7551/mitpress/8996.003.0008openalex-snapshot
First-Order Methods for Nonsmooth Convex Large-Scale Optimization, II: Utilizing Problem’s Structure
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-032-00242-6_20openalex-snapshot
Commentary by Timothée Leleu and Kazuyuki Aihara
inferred← citeshttps://doi.org/10.1007/978-3-032-25176-3_9openalex-snapshot
Formal Constraint-Guided Neural Network Design for Safe and Trustworthy AI
inferred← citeshttps://doi.org/10.1007/s10107-024-02154-4openalex-snapshot
Accelerated-gradient-based generalized Levenberg–Marquardt method with oracle complexity bound and local quadratic convergence
inferred← citeshttps://doi.org/10.1007/s10107-025-02269-2openalex-snapshot
Provable non-accelerations of the heavy-ball method
inferred← citeshttps://doi.org/10.1007/s10208-025-09712-yopenalex-snapshot
An Optimal Lower Bound for Smooth Convex Functions
inferred← citeshttps://doi.org/10.1007/s10589-023-00518-8openalex-snapshot
From Halpern’s fixed-point iterations to Nesterov’s accelerated interpretations for root-finding problems
inferred← citeshttps://doi.org/10.1007/s10598-026-09724-5openalex-snapshot
Inverse kinematic problem in 2d medical acoustic travel-time tomography
inferred← citeshttps://doi.org/10.1007/s10898-025-01526-0openalex-snapshot
On the global convergence of the proximal gradient method for Tikhonov regularized correction of absolute value equations
inferred← citeshttps://doi.org/10.1007/s12532-024-00259-7openalex-snapshot
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python
inferred← citeshttps://doi.org/10.1007/s13160-023-00563-0openalex-snapshot
Inertial projected gradient method for large-scale topology optimization
inferred← citeshttps://doi.org/10.1007/s13748-026-00453-9openalex-snapshot
K-means resilient to Byzantine faults
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.111129openalex-snapshot
A robust control approach to asymptotic optimality of the heavy ball method for optimization of quadratic functions
inferred← citeshttps://doi.org/10.1016/j.cam.2026.117504openalex-snapshot
A C-FISTA-type proximal point algorithm for strongly quasiconvex pseudomonotone equilibrium problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.04.002openalex-snapshot
Accelerated Double-Sketching Subspace Newton
inferred← citeshttps://doi.org/10.1016/j.jcp.2025.114063openalex-snapshot
Nesterov acceleration for ensemble Kalman inversion and variants
inferred← citeshttps://doi.org/10.1016/j.orl.2024.107181openalex-snapshot
A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
inferred← citeshttps://doi.org/10.1080/10556788.2023.2212503openalex-snapshot
Accelerated gradient methods with absolute and relative noise in the gradient
inferred← citeshttps://doi.org/10.1088/1361-6420/adc0b7openalex-snapshot
A guide to stochastic optimisation for large-scale inverse problems
inferred← citeshttps://doi.org/10.1093/imanum/drag026openalex-snapshot
Inexact Newton regularizations with uniformly convex stability terms: a unified convergence analysis
inferred← citeshttps://doi.org/10.1109/access.2024.3488399openalex-snapshot
Accelerated Decentralized Load Balancing in Multi-Agent Networks
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383282openalex-snapshot
On Fundamental Proof Structures in First-Order Optimization
inferred← citeshttps://doi.org/10.1109/dd62861.2024.10768062openalex-snapshot
Comparative Analysis of Two Gradient-Based Approaches to Inverse Problem of Ultrasound Tomography
inferred← citeshttps://doi.org/10.1109/ieeeconf67917.2025.11443331openalex-snapshot
Accelerated Alternating Optimization of MIMO Transceivers
inferred← citeshttps://doi.org/10.1109/oceanslimerick52467.2023.10244735openalex-snapshot
A Robust ADMM-Based Optimization Algorithm For Underwater Acoustic Channel Estimation
inferred← citeshttps://doi.org/10.1109/ssp64130.2025.11073282openalex-snapshot
Doubly Truncated Mode Kriging
inferred← citeshttps://doi.org/10.1109/tcns.2025.3566319openalex-snapshot
A Prediction-Correction Proximal Method for Convex Optimization With Linear Equality and Inequality Constraints
inferred← citeshttps://doi.org/10.1109/tro.2024.3386370openalex-snapshot
GJK++: Leveraging Acceleration Methods for Faster Collision Detection
inferred← citeshttps://doi.org/10.1109/tsp.2026.3672998openalex-snapshot
Estimating Sequences With Memory for Minimizing Convex Nonsmooth Composite Functions
inferred← citeshttps://doi.org/10.1134/s0965542524700076openalex-snapshot
On Some Works of Boris Teodorovich Polyak on the Convergence of Gradient Methods and Their Development
inferred← citeshttps://doi.org/10.1134/s0965542524700131openalex-snapshot
Another Approach to Build Lyapunov Functions for the First Order Methods in the Quadratic Case
inferred← citeshttps://doi.org/10.1134/s0965542525701532openalex-snapshot
Accelerated Iterative Learning Control Algorithms for Discrete Systems under Random Disturbances
inferred← citeshttps://doi.org/10.1137/22m1498486openalex-snapshot
A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization
inferred← citeshttps://doi.org/10.1137/22m1532548openalex-snapshot
Accelerated Forward-Backward Optimization Using Deep Learning
inferred← citeshttps://doi.org/10.1137/23m1575391openalex-snapshot
Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
inferred← citeshttps://doi.org/10.1137/23m1576360openalex-snapshot
nlTGCR: A Class of Nonlinear Acceleration Procedures Based on Conjugate Residuals
inferred← citeshttps://doi.org/10.1137/24m1630475openalex-snapshot
Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
inferred← citeshttps://doi.org/10.1137/24m1643591openalex-snapshot
Improved Convergence Factor of Windowed Anderson Acceleration for Symmetric Fixed-Point Iterations
inferred← citeshttps://doi.org/10.1145/3708502openalex-snapshot
Acceleration by Stepsize Hedging: Multi-Step Descent and the Silver Stepsize Schedule
inferred← citeshttps://doi.org/10.11648/j.ijtam.20241003.11openalex-snapshot
Characterization of a Large Family of Convergent Series That Leads to a Rapid Acceleration of Slowly Convergent Logarithmic Series
inferred← citeshttps://doi.org/10.21608/jealex.2023.292322openalex-snapshot
تصور مقترح لتطبيق التسريع الأكاديمي في مصر علي ضوء بعض التجارب التعليمية الرائدة
inferred← citeshttps://doi.org/10.21608/jfeb.2023.208311.1669openalex-snapshot
التسريع الأكاديمي مدخل لاستثمار التعليم في عصر الثورة الذهنية (رؤية تربوية مقترحة)
inferred← citeshttps://doi.org/10.21608/jfeb.2023.328145openalex-snapshot
التسريع الأكاديمي مدخل لاستثمار التعليم في عصر الثورة الذهنية (رؤية تربوية مقترحة)
inferred← citeshttps://doi.org/10.2298/fil2529205kopenalex-snapshot
Exploring the potential of inertial type algorithms in solving coincidence point/value problems: Theoretical analysis and practical applications
inferred← citeshttps://doi.org/10.23919/ecc57647.2023.10178323openalex-snapshot
Snacks: a fast large-scale kernel SVM solver
inferred← citeshttps://doi.org/10.31857/s0044466924040028openalex-snapshot
On Some Works of Boris Teodorovich Polyak on the Convergence of Gradient Methods and Their Development
inferred← citeshttps://doi.org/10.3390/axioms14110843openalex-snapshot
Structural Results on the HMLasso
inferred← citeshttps://doi.org/10.5802/ojmo.12openalex-snapshot
A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives
inferred← citeshttps://doi.org/10.5802/ojmo.36openalex-snapshot
Short Paper - Quadratic minimization: from conjugate gradient to an adaptive Polyak’s momentum method with Polyak step-sizes
inferred← citeshttps://doi.org/10.70675/0b6154caz7487z4c05za48ez10bc5cf3e158openalex-snapshot
Analysis of Stochastic Algorithms for Sampling and Riemannian Approximation
inferred← citeshttps://doi.org/10.70675/2b5da2e5zc4d8z4e81zbf1cz42560196868bopenalex-snapshot
Étude de méthodes inertielles en optimisation et leur comportement sous conditions de géométrie
inferred← citeshttps://doi.org/10.70675/8bb5d059z149fz4d6az9993z756ea83031c9openalex-snapshot
Primal-dual proximal augmented lagrangian methods for quadratic programming : theory and implementation
inferred← citeshttps://doi.org/10.70675/91b62074za88dz4057z9bc3z31135a9b35edopenalex-snapshot
Approches constructives pour l'analyse de pire cas des méthodes de gradient en optimisation convexe : contributions, éléments de compréhension, et nouveaux résultats.
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.