SuperMann

swMATH36949MaRDI QIDQ52651FDOQ52651

Author name not available (Why is that?)

Cited In (13)

• 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
• A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
• Golden ratio algorithms for variational inequalities
• Solution refinement at regular points of conic problems
• Operator splitting for a homogeneous embedding of the linear complementarity problem
• Title not available (Why is that?)
• 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