LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Multiplication Algorithms for Approximate Optimal Distributions with Cost Constraints

Photo from wikipedia

In this paper, we study the D- and A-optimal assignment problems for regression models with experimental cost constraints. To solve these two problems, we propose two multiplicative algorithms for obtaining… Click to show full abstract

In this paper, we study the D- and A-optimal assignment problems for regression models with experimental cost constraints. To solve these two problems, we propose two multiplicative algorithms for obtaining optimal designs and establishing extended D-optimal (ED-optimal) and A-optimal (EA-optimal) criteria. In addition, we give proof of the convergence of the ED-optimal algorithm and draw conjectures about some properties of the EA-optimal algorithm. Compared with the classical D- and A-optimal algorithms, the ED- and EA-optimal algorithms consider not only the accuracy of parameter estimation, but also the experimental cost constraint. The proposed methods work well in the digital example.

Keywords: optimal optimal; cost; cost constraints; algorithms approximate; approximate optimal; multiplication algorithms

Journal Title: Mathematics
Year Published: 2023

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.