Research on trust-region algorithms for nonlinear programming
J. E. Dennis, R. A. Tapia
Abstract
Open-access reader
J. E. Dennis, R. A. Tapia
Abstract
Open-access reader
This report discusses research on the following topics: interior- point methods for linear programming; trust-region SQP newton's method for general nonlinear programming problems; trust-region SQP newton's method for large sparse nonlinear programming problems with applications to oil reservoir management; a unified approach to global convergence of trust-region methods for nonsmooth optimization; and SQP augmented lagrangian BRGS algorithm for constrained optimization. (LSP).
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This report discusses research on the following topics: interior- point methods for linear programming; trust-region SQP newton's method for general nonlinear programming problems; trust-region SQP newton's method for large sparse nonlinear programming problems with applications to oil reservoir management; a unified approach to global convergence of trust-region methods for nonsmooth optimization; and SQP augmented lagrangian BRGS algorithm for constrained optimization. (LSP).
Key concepts: Sequential quadratic programming, Trust region, Nonlinear programming, Mathematical optimization, Convergence (economics), Nonlinear system, Interior point method, Augmented Lagrangian method