Sufficient conditions for the linear convergence of an algorithm for finding the metric projection of a point onto a convex compact set

DOI10.1134/s0001434623050036zbMath1527.90154MaRDI QIDQ6114298

Maxim V. Balashov

Publication date: 11 July 2023

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

nonsmooth analysisgradient projection methodsupporting ballfunction growth conditions

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Cites Work

• On the convexity of integrals of multivalued mappings. Applications in control theory
• Subgradient methods for sharp weakly convex functions
• On the gradient projection method for weakly convex functions on a proximally smooth set
• Integrals of set-valued functions
• Interior sphere property of attainable sets and time optimal control problems
• Embedding of a homothete in a convex compactum: an algorithm and its convergence
• Strong convexity of reachable sets of linear systems
• Unnamed Item
• Unnamed Item
• Unnamed Item