Unknown

Dataset Information

0

A Path Algorithm for Constrained Estimation.


ABSTRACT: Many least-square problems involve affine equality and inequality constraints. Although there are a variety of methods for solving such problems, most statisticians find constrained estimation challenging. The current article proposes a new path-following algorithm for quadratic programming that replaces hard constraints by what are called exact penalties. Similar penalties arise in l1 regularization in model selection. In the regularization setting, penalties encapsulate prior knowledge, and penalized parameter estimates represent a trade-off between the observed data and the prior knowledge. Classical penalty methods of optimization, such as the quadratic penalty method, solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ?, one recovers the constrained solution. In the exact penalty method, squared penalties!are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. The exact path-following method starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. Path following in Lasso penalized regression, in contrast, starts with a large value of the penalty constant and works its way downward. In both settings, inspection of the entire solution path is revealing. Just as with the Lasso and generalized Lasso, it is possible to plot the effective degrees of freedom along the solution path. For a strictly convex quadratic program, the exact penalty algorithm can be framed entirely in terms of the sweep operator of regression analysis. A few well-chosen examples illustrate the mechanics and potential of path following. This article has supplementary materials available online.

SUBMITTER: Zhou H 

PROVIDER: S-EPMC3772096 | biostudies-literature | 2013

REPOSITORIES: biostudies-literature

altmetric image

Publications

A Path Algorithm for Constrained Estimation.

Zhou Hua H   Lange Kenneth K  

Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America 20130101 2


Many least-square problems involve affine equality and inequality constraints. Although there are a variety of methods for solving such problems, most statisticians find constrained estimation challenging. The current article proposes a new path-following algorithm for quadratic programming that replaces hard constraints by what are called exact penalties. Similar penalties arise in <i>l</i><sub>1</sub> regularization in model selection. In the regularization setting, penalties encapsulate prior  ...[more]

Similar Datasets

| S-EPMC6407770 | biostudies-literature
| S-EPMC4586264 | biostudies-literature
| S-EPMC4828333 | biostudies-literature
| S-EPMC3037843 | biostudies-other
| S-EPMC7197229 | biostudies-literature
| S-EPMC5594463 | biostudies-literature
| S-EPMC6196076 | biostudies-other
| S-EPMC3083079 | biostudies-literature
| S-EPMC9635739 | biostudies-literature
| S-EPMC5528885 | biostudies-literature