Embedding of a homothete in a convex compactum: an algorithm and its convergence
From MaRDI portal
Publication:5867592
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
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3271295 (Why is no real title available?)
- $ M$-strongly convex subsets and their generating sets
- Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds
- Interior sphere property of attainable sets and time optimal control problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Strong and Weak Convexity of Closed Sets in a Hilbert Space
Cited in
(2)
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)
