No label defined (Q3694573)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3919685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3919685 |
Statements
1985
0 references
software development
0 references
quasi-Newton method
0 references
sequential quadratic programming methods
0 references
0.7972671985626221
0 references
0.7859980463981628
0 references
[For the entire collection see Zbl 0552.00011.] The intention of the paper is to show by means of specific examples, that the development of numerical software influences theoretical research in mathematical programming. The authors consider the implementation of quadratic programming methods and its relationship to the implementation of sequential quadratic (SQP)-programming methods for nonlinear optimization, which are based on formulating and solving a sequence of quadratic programming problems. They explain the inefficiencies of a ''black box'' implementation of an active set method and some possibilities to improve the initial phase I for finding a feasible point. Particular attention is given to improve the factorization of the working set also with the aim to handle linear and nonlinear constraints separately. Alternative possibilities for computing an initial projected Hessian and for representing quasi-Newton matrices are discussed. Further investigation of active sets separately for linear and nonlinear constraints, lead to a new subclass of SQP-methods. Also the representation of Hessian matrices for sparse quadratic programs is considered.
0 references