On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2007.02.013 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: MVE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133629339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical methods for shape fitting and kinetic data structures using core sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Complexity for Maximum Volume Inscribed Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences converging to D-optimal designs of experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate clustering via core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ellipsoid Method Generates Dual Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster core-set constructions and data stream algorithms in fixed dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for Computing and Modifying the LDV Factors of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifications and implementation of the ellipsoid algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some comments on Wolfe's ‘away step’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding of Polytopes in the Real Number Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating the maximal inscribed ellipsoid for a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate minimum enclosing balls in high dimensions using core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-volume enclosing ellipsoids and core sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-concordant convex–concave functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Covering Ellipses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric approach to optimal design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Minimum-Volume Covering Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal design: Some geometrical aspects of D-optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of Correlation Coefficients by Ellipsoidal Trimming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinant Maximization with Linear Matrix Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sequential Generation of $D$-Optimum Experimental Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Numerical Solution of the Maximum Volume Ellipsoid Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2007.02.013 / rank
 
Normal rank

Latest revision as of 07:36, 18 December 2024

scientific article
Language Label Description Also known as
English
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
scientific article

    Statements

    On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (English)
    0 references
    0 references
    0 references
    18 September 2007
    0 references
    Löwner ellipsoid
    0 references
    core sets
    0 references
    rounding of polytopes
    0 references
    ellipsoid method
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers