A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms (Q1941215)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
scientific article

    Statements

    A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms (English)
    0 references
    12 March 2013
    0 references
    A fist-order method to find the minimum cross-sectional area ellipsoidal cylinder (MAEC) containing a finite set of points is studied. ``This problem arises in optimal design in statistics when one is interested in a subset of the parameters'' write the authors in the abstract. Simple convex formulations of the MAEC problem and its dual are proposed. The Frank-Wolfe algorithm is the basis of the method for solving this problem and its dual. Convergence of the algorithm is investigated. The article gives examples illustrating the efficiency of the algorithms.
    0 references
    linear convergence
    0 references
    Frank-Wolfe algorithm
    0 references
    minimum-volume ellipsoids
    0 references
    minimum-area cylinders
    0 references
    numerical examples
    0 references
    optimal design
    0 references
    convergence
    0 references

    Identifiers