Ubiquitous algorithms in convex optimization generate self-contracted sequences

zbMath1489.90111arXiv2003.04201MaRDI QIDQ3391375

Axel Böhm, Aris Daniilidis

Publication date: 28 March 2022

Full work available at URL: https://arxiv.org/abs/2003.04201

zbMATH Keywords

alternating projectionproximal-gradient algorithmself-contracted curve

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Related Items (1)

Global convergence of the gradient method for functions definable in o-minimal structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• There is no variational characterization of the cycles in the method of periodic projections
• Maximum length of steepest descent curves for quasi-convex functions
• Asymptotic behaviour of self-contracted planar curves and gradient orbits of convex functions
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Rectifiability of non Euclidean planar self-contracted curves
• Self-contracted curves in CAT(0)-spaces and their rectifiability
• Metric and geometric relaxations of self-contracted curves
• Rectifiability of self-contracted curves in the Euclidean space and applications
• Self-contracted curves in Riemannian manifolds
• Self-Contracted Curves in Spaces With Weak Lower Curvature Bound
• On Projection Algorithms for Solving Convex Feasibility Problems
• On steepest descent curves for quasi convex families in Rn
• Self-contracted curves have finite length
• Self-contracted curves are gradient flows of convex functions
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Ubiquitous algorithms in convex optimization generate self-contracted sequences