On the complexity of approximating the maximal inscribed ellipsoid for a polytope
From MaRDI portal
(Redirected from Publication:1315411)
Recommendations
- Improved Complexity for Maximum Volume Inscribed Ellipsoids
- Computing the maximum volume inscribed ellipsoid of a polytopic projection
- Complexity investigations on the ellipsoid algorithm
- Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
- On the combinatorial complexity of approximating polytopes
- On the combinatorial complexity of approximating polytopes
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
- Approximation of convex bodies by inscribed simplices of maximum volume
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes.
Cites work
- scientific article; zbMATH DE number 3158856 (Why is no real title available?)
- scientific article; zbMATH DE number 4123531 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- A Potential Reduction Algorithm Allowing Column Generation
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An Algorithm for Separating Patterns by Ellipsoids
- On the complexity of four polyhedral set containment problems
- Optimal design: Some geometrical aspects of D-optimality
- Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden
Cited in
(36)- On self-concordant convex–concave functions
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
- Approximating fixed points of weakly contracting mappings
- An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming†
- Relatively smooth convex optimization by first-order methods, and applications
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Scientific contributions of Leo Khachiyan (a short overview)
- Algorithms to construct a minimum-volume invariant ellipsoid for a stable dynamic system
- Methods of centers for variational inequalities and linear programming
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- Interior-point methods: An old and new approach to nonlinear programming
- Clustering via minimum volume ellipsoids
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- A modification of the inscribed ellipsoid method
- How to solve a design centering problem
- On the minimum volume simplex enclosure problem for estimating a linear mixing model
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- Sharpening geometric inequalities using computable symmetry measures
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
- A cutting plane algorithm for convex programming that uses analytic centers
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes.
- Conditional minimum volume ellipsoid with application to multiclass discrimination
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Minimum-volume enclosing ellipsoids and core sets
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- Playing Billiards in Version Space
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
- Most likely maximum entropy for population analysis with region-censored data
- Inscribed ball and enclosing box methods for the convex maximization problem
- Oracle-polynomial-time approximation of largest simplices in convex bodies
- Accuracy certificates for convex minimization with inexact oracle
- A portfolio selection model using fuzzy returns
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
This page was built for publication: On the complexity of approximating the maximal inscribed ellipsoid for a polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315411)
