Rounding of Polytopes in the Real Number Model of Computation

DOI10.1287/moor.21.2.307zbMath0856.68066OpenAlexW2138663260MaRDI QIDQ4895560

Leonid G. Khachiyan

Publication date: 14 October 1996

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.21.2.307

zbMATH Keywords

real number model of computation

Mathematics Subject Classification ID

Related Items (39)

A Newton Frank-Wolfe method for constrained self-concordant minimization ⋮ Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming ⋮ On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ Clustering via minimum volume ellipsoids ⋮ Enhancing Pure-Pixel Identification Performance via Preconditioning ⋮ Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization ⋮ Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier ⋮ An interval estimator for the unmixing of mixtures with set-based source descriptions ⋮ Computing minimum-volume enclosing ellipsoids ⋮ A hybrid robust-stochastic optimization approach for day-ahead scheduling of cascaded hydroelectric system in restructured electricity market ⋮ A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids ⋮ Sliding window algorithm for parametric identification of dynamical systems with rectangular and ellipsoid parameter uncertainty domains ⋮ Convergence rate analysis of the multiplicative gradient method for PET-type problems ⋮ Optimal portfolio and confidence set ⋮ Relatively Smooth Convex Optimization by First-Order Methods, and Applications ⋮ Rank-two update algorithms for the minimum volume enclosing ellipsoid problem ⋮ Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization ⋮ A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ John ellipsoid and the center of mass of a convex body ⋮ Computing minimum-volume enclosing axis-aligned ellipsoids ⋮ Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices ⋮ Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem ⋮ New analysis and results for the Frank-Wolfe method ⋮ A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach ⋮ Small-scale reconstruction in three-dimensional Kolmogorov flows using four-dimensional variational data assimilation ⋮ The Geometry of Differential Privacy: The Small Database and Approximate Cases ⋮ Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids ⋮ Rounding of convex sets and efficient gradient methods for linear programming problems ⋮ Fast subspace approximation via greedy least-squares ⋮ Convex programming based spectral clustering ⋮ Projective re-normalization for improving the behavior of a homogeneous conic linear system ⋮ Approximation Algorithms for D-optimal Design ⋮ Detecting redundancy in optimization problems over intersection of ellipsoids ⋮ Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization ⋮ Fast algorithms for the minimum volume estimator ⋮ Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction ⋮ Minimum-volume enclosing ellipsoids and core sets ⋮ Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem

This page was built for publication: Rounding of Polytopes in the Real Number Model of Computation