MODEL Procedure

Restrictions and Bounds on Parameters

Using the BOUNDS and RESTRICT statements, PROC MODEL can compute optimal estimates subject to equality or inequality constraints on the parameter estimates.

Equality restrictions can be written as a vector function:

bold h left-parenthesis theta right-parenthesis equals 0

Inequality restrictions are either active or inactive. When an inequality restriction is active, it is treated as an equality restriction. All inactive inequality restrictions can be written as a vector function:

upper F left-parenthesis theta right-parenthesis greater-than-or-equal-to 0

Strict inequalities, such as left-parenthesis f left-parenthesis theta right-parenthesis greater-than 0 right-parenthesis, are transformed into inequalities as f left-parenthesis theta right-parenthesis times left-parenthesis 1 minus epsilon right-parenthesis minus epsilon greater-than-or-equal-to 0, where the tolerance epsilon is controlled by the EPSILON= option in the FIT statement and defaults to 10 Superscript negative 8. The ith inequality restriction becomes active if upper F Subscript i Baseline less-than 0 and remains active until its Lagrange multiplier becomes negative. Lagrange multipliers are computed for all the nonredundant equality restrictions and all the active inequality restrictions.

For the following, assume the vector bold h left-parenthesis theta right-parenthesis contains all the current active restrictions. The constraint matrix bold upper A is

bold upper A left-parenthesis ModifyingAbove theta With caret right-parenthesis equals StartFraction partial-differential bold h left-parenthesis ModifyingAbove theta With caret right-parenthesis Over partial-differential ModifyingAbove theta With caret EndFraction

The covariance matrix for the restricted parameter estimates is computed as

bold upper Z left-parenthesis bold upper Z prime bold upper H bold upper Z right-parenthesis Superscript negative 1 Baseline bold upper Z prime

where bold upper H is Hessian or approximation to the Hessian of the objective function (left-parenthesis bold upper X prime left-parenthesis normal d normal i normal a normal g left-parenthesis bold upper S right-parenthesis Superscript negative 1 Baseline circled-times bold upper I right-parenthesis bold upper X right-parenthesis for OLS), and bold upper Z is the last left-parenthesis n p minus n c right-parenthesis columns of bold upper Q. bold upper Q is from an LQ factorization of the constraint matrix, nc is the number of active constraints, and np is the number of parameters. For more information about LQ factorization, see Gill, Murray, and Wright (1981). The covariance column in Table 2 summarizes the Hessian approximation used for each estimation method.

The covariance matrix for the Lagrange multipliers is computed as

left-parenthesis bold upper A bold upper H Superscript negative 1 Baseline bold upper A prime right-parenthesis Superscript negative 1

The p-value reported for a restriction is computed from a beta distribution rather than a t distribution because the numerator and the denominator of the t ratio for an estimated Lagrange multiplier are not independent.

The Lagrange multipliers for the active restrictions are printed with the parameter estimates. The Lagrange multiplier estimates are computed using the relationship

bold upper A Superscript prime Baseline lamda equals normal g

where the dimensions of the constraint matrix bold upper A are the number of constraints by the number of parameters, lamda is the vector of Lagrange multipliers, and g is the gradient of the objective function at the final estimates.

The final gradient includes the effects of the estimated bold upper S matrix. For example, for OLS the final gradient would be

normal g equals bold upper X prime left-parenthesis normal d normal i normal a normal g left-parenthesis bold upper S right-parenthesis Superscript negative 1 Baseline circled-times bold upper I right-parenthesis r

where r is the residual vector. Note that when nonlinear restrictions are imposed, the convergence measure R might have values greater than one for some iterations.

Last updated: June 19, 2025