### Feasible Starting Point

Two algorithms are used to obtain a feasible starting point.

• When only boundary constraints are specified:

• If the parameter , , violates a two-sided boundary constraint (or an equality constraint) , the parameter is given a new value inside the feasible interval, as follows:

• If the parameter , , violates a one-sided boundary constraint or , the parameter is given a new value near the violated boundary, as follows:

• When general linear constraints are specified, the algorithm of Schittkowski and Stoer (1979) computes a feasible point, which may be quite far from a user-specified infeasible point.