IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v51y2007i12p5547-5561.html
   My bibliography  Save this article

Construction of marginally and conditionally restricted designs using multiplicative algorithms

Author

Listed:
  • Martin-Martin, R.
  • Torsney, B.
  • Lopez-Fidalgo, J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Martin-Martin, R. & Torsney, B. & Lopez-Fidalgo, J., 2007. "Construction of marginally and conditionally restricted designs using multiplicative algorithms," Computational Statistics & Data Analysis, Elsevier, vol. 51(12), pages 5547-5561, August.
  • Handle: RePEc:eee:csdana:v:51:y:2007:i:12:p:5547-5561
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(07)00138-7
    Download Restriction: Full text for ScienceDirect subscribers only.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. D. M. Titterington, 1978. "Estimation of Correlation Coefficients by Ellipsoidal Trimming," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 27(3), pages 227-234, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Duarte, Belmiro P.M. & Sagnol, Guillaume & Wong, Weng Kee, 2018. "An algorithm based on semidefinite programming for finding minimax optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 119(C), pages 99-117.
    2. Tommasi, C. & López-Fidalgo, J., 2010. "Bayesian optimum designs for discriminating between models with any distribution," Computational Statistics & Data Analysis, Elsevier, vol. 54(1), pages 143-150, January.
    3. Harman, Radoslav & Filová, Lenka, 2014. "Computing efficient exact designs of experiments using integer quadratic programming," Computational Statistics & Data Analysis, Elsevier, vol. 71(C), pages 1159-1167.
    4. García-Ródenas, Ricardo & García-García, José Carlos & López-Fidalgo, Jesús & Martín-Baos, José Ángel & Wong, Weng Kee, 2020. "A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs," Computational Statistics & Data Analysis, Elsevier, vol. 144(C).
    5. Lianyan Fu & Faming Ma & Zhuoxi Yu & Zhichuan Zhu, 2023. "Multiplication Algorithms for Approximate Optimal Distributions with Cost Constraints," Mathematics, MDPI, vol. 11(8), pages 1-14, April.
    6. Víctor Casero-Alonso & Jesús López-Fidalgo, 2015. "Experimental designs in triangular simultaneous equations models," Statistical Papers, Springer, vol. 56(2), pages 273-290, May.
    7. López-Fidalgo, J. & Rivas-López, M.J., 2014. "Optimal experimental designs for partial likelihood information," Computational Statistics & Data Analysis, Elsevier, vol. 71(C), pages 859-867.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Karim Abou-Moustafa & Frank P. Ferrie, 2018. "Local generalized quadratic distance metrics: application to the k-nearest neighbors classifier," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(2), pages 341-363, June.
    2. Peter Goos & Bradley Jones & Utami Syafitri, 2016. "I-Optimal Design of Mixture Experiments," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 111(514), pages 899-911, April.
    3. Nolan, D., 1999. "On min-max majority and deepest points," Statistics & Probability Letters, Elsevier, vol. 43(4), pages 325-333, July.
    4. Yu, Yaming, 2010. "Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 54(6), pages 1419-1425, June.
    5. Dolia, A.N. & Harris, C.J. & Shawe-Taylor, J.S. & Titterington, D.M., 2007. "Kernel ellipsoidal trimming," Computational Statistics & Data Analysis, Elsevier, vol. 52(1), pages 309-324, September.
    6. Dette, Holger & Pepelyshev, Andrey & Zhigljavsky, Anatoly, 2008. "Improving updating rules in multiplicative algorithms for computing D-optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 53(2), pages 312-320, December.
    7. Rosa, Samuel & Harman, Radoslav, 2022. "Computing minimum-volume enclosing ellipsoids for large datasets," Computational Statistics & Data Analysis, Elsevier, vol. 171(C).
    8. Bernard, Carole & Vanduffel, Steven, 2015. "A new approach to assessing model risk in high dimensions," Journal of Banking & Finance, Elsevier, vol. 58(C), pages 166-178.
    9. Beirlant, J. & Mason, D. M. & Vynckier, C., 1999. "Goodness-of-fit analysis for multivariate normality based on generalized quantiles," Computational Statistics & Data Analysis, Elsevier, vol. 30(2), pages 119-142, April.
    10. Harman, Radoslav & Pronzato, Luc, 2007. "Improvements on removing nonoptimal support points in D-optimum design algorithms," Statistics & Probability Letters, Elsevier, vol. 77(1), pages 90-94, January.
    11. Pronzato, Luc, 2003. "Removing non-optimal support points in D-optimum design algorithms," Statistics & Probability Letters, Elsevier, vol. 63(3), pages 223-228, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:51:y:2007:i:12:p:5547-5561. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.