Embedding of a homothete in a convex compactum: an algorithm and its convergence

DOI10.20310/2686-9667-2022-27-138-143-149OpenAlexW4285411792MaRDI QIDQ5867592

Maxim V. Balashov

Publication date: 14 September 2022

Published in: Russian Universities Reports. Mathematics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/vtamu252

zbMATH Keywords

nonconvex optimizationgradient projection methodstrong convexityuniform smoothnesssupporting function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Interior sphere property of attainable sets and time optimal control problems
• $ M$-strongly convex subsets and their generating sets
• Strong and Weak Convexity of Closed Sets in a Hilbert Space
• Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds

This page was built for publication: Embedding of a homothete in a convex compactum: an algorithm and its convergence