A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128743893, #quickstatements; #temporary_batch_1728306610321
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1801.05661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the minimum volume estimator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3445852 / 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: A vertex-exchange-method in D-optimal design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate optimal designs for multivariate polynomial regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Robust, Linear-Optimal Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-oriented design of experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated, Parallel, and Proximal Coordinate Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Iterative Methods for Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative methods for computing \(D\)-optimal stratified designs of experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Methods for Linear Constraints: Convergence Rates and Conditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2947862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2790294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random block coordinate descent methods for linearly constrained optimization over networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Design of Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel coordinate descent methods for big data optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Coordinate Descent Method for Learning with Big Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing exact \(D\)-optimal designs by mixed integer second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for optimal designs on a design space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization / 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: Minimum-Volume Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative algorithms for computing optimum designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: D-optimal design of a monitoring network for parameter estimation of distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic convergence of a general algorithm for computing optimal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: D-optimal designs via a cocktail algorithm / 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: The Sequential Generation of $D$-Optimum Experimental Designs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128743893 / rank
 
Normal rank

Latest revision as of 15:02, 7 October 2024

scientific article
Language Label Description Also known as
English
A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
scientific article

    Statements

    A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2020
    0 references
    \(A\)-optimality
    0 references
    convex optimization
    0 references
    \(D\)-optimality
    0 references
    \(I\)-optimality
    0 references
    minimum-volume enclosing ellipsoid
    0 references
    optimal approximate designs of experiments
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references