SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators
From MaRDI portal
Publication:5211256
DOI10.1109/TAC.2019.2906393zbMath1482.49019arXiv1609.06955OpenAlexW3104069849WikidataQ128137672 ScholiaQ128137672MaRDI QIDQ5211256
Andreas Themelis, Panagiotis Patrinos
Publication date: 28 January 2020
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.06955
Convex programming (90C25) Methods of quasi-Newton type (90C53) Set-valued and variational analysis (49J53) Discrete-time control/observation systems (93C55) Fixed-point theorems (47H10)
Related Items (12)
Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms ⋮ Golden ratio algorithms for variational inequalities ⋮ Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators ⋮ Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations ⋮ Anderson Accelerated Douglas--Rachford Splitting ⋮ Unnamed Item ⋮ Solution refinement at regular points of conic problems ⋮ Chordal decomposition in operator-splitting methods for sparse semidefinite programs ⋮ A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima ⋮ Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem ⋮ Multiply Accelerated Value Iteration for NonSymmetric Affine Fixed Point Problems and Application to Markov Decision Processes ⋮ On a primal-dual Newton proximal method for convex quadratic programs
Uses Software
This page was built for publication: SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators
