Improving Convergence Rates of a Class of Algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 418920
- Algorithms for the construction of optimizing distributions
- Construction of optimal designs using a clustering approach
- Two classes of multiplicative algorithms for constructing optimizing distributions
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
Cites work
Cited in
(12)- Two classes of multiplicative algorithms for constructing optimizing distributions
- Implications of convergence rates in Sinkhorn balancing
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- Construction of optimal designs using a clustering approach
- scientific article; zbMATH DE number 418920 (Why is no real title available?)
- scientific article; zbMATH DE number 3890235 (Why is no real title available?)
- scientific article; zbMATH DE number 13215 (Why is no real title available?)
- Improved Convergence Rates for Intermediate Problems
- Algorithms for the construction of optimizing distributions
- Improving the convergence rate of the DIRECT global optimization algorithm
- Improving the Convergence of the Periodic QZ Algorithm
- Monotonic convergence of a general algorithm for computing optimal designs
This page was built for publication: Improving Convergence Rates of a Class of Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439057)