scientific article

zbMath1486.52005MaRDI QIDQ3391378

Maxim V. Balashov

Publication date: 28 March 2022

Full work available at URL: https://www.heldermann.de/JCA/JCA29/JCA291/jca29009.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programmingHausdorff distanceChebyshev centersupporting functionstability of minimization problem

Mathematics Subject Classification ID

Linear programming (90C05) Best approximation, Chebyshev systems (41A50) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (2)

Unnamed Item ⋮ Covering a set by a convex compactum: error estimates and computation

Cites Work

• Unnamed Item
• Unnamed Item
• On polyhedral approximations in an \(n\)-dimensional space
• Polyhedral approximations of strictly convex compacta
• An algorithm for finding the Chebyshev center of a convex polyhedron
• Solution methodologies for the smallest enclosing circle problem
• A new approximate algorithm for the Chebyshev center
• Optimal algorithms theory for robust estimation and prediction
• LINEAR DIFFERENTIAL GAMES OF PURSUIT
• Set-Membership Error-in-Variables Identification Through Convex Relaxation Techniques
• Geometry. I, II. Transl. from the French by M. Cole and S. Levy

This page was built for publication: