Reducible Nonlinear Programming Problems

Date
1985-05
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract

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.

Description
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/15927
Advisor
Degree
Type
Technical report
Keywords
Citation

Parks, Teresa Anne. "Reducible Nonlinear Programming Problems." (1985) https://hdl.handle.net/1911/101585.

Has part(s)
Forms part of
Published Version
Rights
Link to license
Citable link to this page