REDUCIBLE NONLINEAR PROGRAMMING PROBLEMS (SEPARABLE LEAST SQUARES)
|PARKS, TERESA ANNE
|In this thesis we are concerned with general nonlinear programming problems in which the variables can be naturally separated into two groups. This separation has the property that if the variables in one of the groups are fixed, then it is easy to solve the problem in terms of the unspecified variables. The existing work in nonlinear least squares has been extended to handle inequality constraints and further extended to certain classes of nonlinear programming problems which have special structure.
|Thesis Math. Sci. 1985 Parks
|PARKS, TERESA ANNE. "REDUCIBLE NONLINEAR PROGRAMMING PROBLEMS (SEPARABLE LEAST SQUARES)." (1985) Diss., Rice University. <a href="https://hdl.handle.net/1911/15927">https://hdl.handle.net/1911/15927</a>.
|Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.
|REDUCIBLE NONLINEAR PROGRAMMING PROBLEMS (SEPARABLE LEAST SQUARES)
|Doctor of Philosophy