REDUCIBLE NONLINEAR PROGRAMMING PROBLEMS (SEPARABLE LEAST SQUARES)

Simple item page
dc.creatorPARKS, TERESA ANNE
dc.date.accessioned2007-05-09T19:39:34Z
dc.date.available2007-05-09T19:39:34Z
dc.date.issued1985
dc.description.abstractIn 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.
dc.format.mimetypeapplication/pdf
dc.identifier.callnoThesis Math. Sci. 1985 Parks
dc.identifier.citationPARKS, 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>.
dc.identifier.urihttps://hdl.handle.net/1911/15927
dc.language.isoeng
dc.rightsCopyright 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.
dc.subjectMathematics
dc.titleREDUCIBLE NONLINEAR PROGRAMMING PROBLEMS (SEPARABLE LEAST SQUARES)
dc.typeThesis
dc.type.materialText
thesis.degree.departmentMathematical Sciences
thesis.degree.disciplineEngineering
thesis.degree.grantorRice University
thesis.degree.levelDoctoral
thesis.degree.nameDoctor of Philosophy
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
8517229.PDF
Size:
2 MB
Format:
Adobe Portable Document Format
Download
Collections
Rice University Electronic Theses and Dissertations