Rounding of Polytopes in the Real Number Model of Computation
From MaRDI portal
Publication:4895560
DOI10.1287/moor.21.2.307zbMath0856.68066MaRDI QIDQ4895560
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
68Q25: Analysis of algorithms and problem complexity
52B55: Computational aspects related to convexity
Related Items
Detecting redundancy in optimization problems over intersection of ellipsoids, Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization, Relatively Smooth Convex Optimization by First-Order Methods, and Applications, Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming, Small-scale reconstruction in three-dimensional Kolmogorov flows using four-dimensional variational data assimilation, Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization, Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction, 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, New analysis and results for the Frank-Wolfe method, A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach, Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier, Computing minimum-volume enclosing ellipsoids, A hybrid robust-stochastic optimization approach for day-ahead scheduling of cascaded hydroelectric system in restructured electricity market, 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, Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem, Rank-two update algorithms for the minimum volume enclosing ellipsoid problem, Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices, Fast subspace approximation via greedy least-squares, Minimum-volume enclosing ellipsoids and core sets, An interval estimator for the unmixing of mixtures with set-based source descriptions, Scientific contributions of Leo Khachiyan (a short overview), Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem, Projective re-normalization for improving the behavior of a homogeneous conic linear system, Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, John ellipsoid and the center of mass of a convex body, Convex programming based spectral clustering, A Newton Frank-Wolfe method for constrained self-concordant minimization, Fast algorithms for the minimum volume estimator, On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, Clustering via minimum volume ellipsoids, A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria, Computing minimum-volume enclosing axis-aligned ellipsoids, The Geometry of Differential Privacy: The Small Database and Approximate Cases, A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids, Enhancing Pure-Pixel Identification Performance via Preconditioning, Approximation Algorithms for D-optimal Design
