Embedding of a homothete in a convex compactum: an algorithm and its convergence
DOI10.20310/2686-9667-2022-27-138-143-149OpenAlexW4285411792MaRDI QIDQ5867592FDOQ5867592
Authors: 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
Recommendations
- Covering a set by a convex compactum: error estimates and computation
- Approximate calculation of the Chebyshev center for a convex compact set in \(\mathbb{R}^n\)
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices
- A problem of packing homothetic convex polytopes
nonconvex optimizationgradient projection methodstrong convexityuniform smoothnesssupporting function
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)
Cites Work
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Title not available (Why is that?)
- $ M$-strongly convex subsets and their generating sets
- Title not available (Why is that?)
- Interior sphere property of attainable sets and time optimal control problems
- 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
Cited In (1)
This page was built for publication: Embedding of a homothete in a convex compactum: an algorithm and its convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5867592)
