Fast algorithms for the minimum volume estimator
From MaRDI portal
Publication:2349524
DOI10.1007/s10898-014-0233-8zbMath1325.90085OpenAlexW2086132820MaRDI QIDQ2349524
Publication date: 22 June 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0233-8
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Computing minimum-volume enclosing ellipsoids for large datasets ⋮ Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming ⋮ Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints ⋮ A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments ⋮ On greedy heuristics for computing D-efficient saturated subsets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- D-optimal designs via a cocktail algorithm
- Benchmark testing of algorithms for very robust regression: FS, LMS and LTS
- Multiplicative algorithms for computing optimum designs
- Minimum-volume enclosing ellipsoids and core sets
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Improved feasible solution algorithms for high breakdown estimation.
- Applications of semidefinite programming
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- On the minimum volume simplex enclosure problem for estimating a linear mixing model
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
- Sequences converging to D-optimal designs of experiments
- Introduction to nonlinear and global optimization
- Two Algorithms for the Minimum Enclosing Ball Problem
- Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
- An algorithm for optimal designs on a design space
- Rounding of Polytopes in the Real Number Model of Computation
- Computation of Minimum-Volume Covering Ellipsoids
- On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- Optimal and Efficient Designs of Experiments
- The Sequential Generation of $D$-Optimum Experimental Designs
This page was built for publication: Fast algorithms for the minimum volume estimator
