Testing and non-linear preconditioning of the proximal point method
From MaRDI portal
Publication:2198162
DOI10.1007/s00245-018-9541-6OpenAlexW2952233565MaRDI QIDQ2198162
Publication date: 9 September 2020
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.05705
Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods for variational inequalities and related problems (65K15)
Related Items (12)
Chambolle-Pock's primal-dual method with mismatched adjoint ⋮ Inertial, Corrected, Primal-Dual Proximal Splitting ⋮ Linearly convergent bilevel optimization with single-step inner methods ⋮ An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming ⋮ Primal-dual block-proximal splitting for a class of non-convex problems ⋮ Acceleration and Global Convergence of a First-Order Primal-Dual Method for Nonconvex Problems ⋮ Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization ⋮ Predictive online optimisation with applications to optical flow ⋮ Preconditioned proximal point methods and notions of partial subregularity ⋮ Block-proximal methods with spatially adapted acceleration ⋮ Regularisation, optimisation, subregularity ⋮ Degenerate Preconditioned Proximal Point Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Parallel coordinate descent methods for big data optimization
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Über die Methode sukzessiver Approximationen
- An inertial forward-backward algorithm for monotone inclusions
- Proximal minimization algorithm with \(D\)-functions
- Acceleration of the PDHGM on partially strongly convex functions
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Block-proximal methods with spatially adapted acceleration
- Coordinate descent algorithms
- Construction of fixed points of demicompact mappings in Hilbert space
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- Proximal Newton-Type Methods for Minimizing Composite Functions
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Monotone Operators and the Proximal Point Algorithm
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- NONEXPANSIVE NONLINEAR OPERATORS IN A BANACH SPACE
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Perturbations of nonlinear maximal monotone sets in banach space
- Mean Value Methods in Iteration
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Testing and non-linear preconditioning of the proximal point method