Cited in
(17)- Multiply accelerated value iteration for nonsymmetric affine fixed point problems and application to Markov decision processes
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
- Anderson Accelerated Douglas--Rachford Splitting
- Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators
- CDCS
- POGS
- SuperSCS
- Golden ratio algorithms for variational inequalities
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- Solution refinement at regular points of conic problems
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- Alpaqa
- scientific article; zbMATH DE number 7626727 (Why is no real title available?)
- SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators
- Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
- On a primal-dual Newton proximal method for convex quadratic programs
This page was built for software: SuperMann
