IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-387-22677-4_19.html
   My bibliography  Save this book chapter

Minimization of a Second-Degree Polynomial (in n Variables) Subject to Linear Constraints

In: Matrix Algebra From a Statistician’s Perspective

Author

Listed:
  • David A. Harville

    (IBM T.J. Watson Research Center, Mathematical Sciences Department)

Abstract

The subject of this chapter is the minimization of a quadratic form, or, more generally, a second-degree polynomial, in some number, say n, of variables that may be subject to linear constraints. Special cases of this minimization problem are encountered in various areas of statistics and in many related disciplines. In particular, they are encountered in estimating the parameters of a linear statistical model. One approach to the estimation goes by the acronym BLUE (for best linear unbiased estimation); in this approach, consideration is restricted to estimators that are linear (i.e., that are expressible as linear combinations of the data) and that are unbiased (i.e., whose “expected values” equal the parameters), and the estimator of each parameter is chosen to have minimum variance among all estimators that are linear and unbiased. The minimization problem encompassed in this approach can be formulated as one of minimizing a quadratic form (in the coefficients of the linear combination) subject to linear constraints—the constraints arise from the restriction to unbiased estimators. Another approach is to regard the estimation of the parameters as a least squares Problem—the least squares problem was considered (from a geometrical perspective) in Chapter 12. This approach consists of minimizing the sum of the squared deviations between the data points and the linear combinations of the parameters (in the model) that correspond to those points. The sum of the squared deviations is a second-degree polynomial (in the parameters). In some cases, the parameters of the model may be subject to linear constraints—knowledge of the process that gave rise to the data may suggest such constraints (along with the other aspects of the model). In the presence of such constraints, the minimization problem encompassed in the least squares appraoch is one of minimizing a second-degree polynomial (in the parameters) subject to linear constraints (on the parameters).

Suggested Citation

  • David A. Harville, 1997. "Minimization of a Second-Degree Polynomial (in n Variables) Subject to Linear Constraints," Springer Books, in: Matrix Algebra From a Statistician’s Perspective, chapter 19, pages 459-495, Springer.
  • Handle: RePEc:spr:sprchp:978-0-387-22677-4_19
    DOI: 10.1007/0-387-22677-X_19
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    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:spr:sprchp:978-0-387-22677-4_19. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.