No label defined (Q3340640)
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 3873095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3873095 |
Statements
1982
0 references
software
0 references
survey
0 references
constrained nonlinear programming
0 references
0.7892367839813232
0 references
0.7856826186180115
0 references
[For the entire collection see Zbl 0541.00004.] The constrained nonlinear programming problem can be written in the form (NLP): min f(x), \(x\in R^ n\), \(c_ j(x)=0 (j=1,2,...,m_ e)\), \(c_ j(x)\geq 0 (j=m_ e+1,...,m)\). In the following, we proceed from the assumptions that (a) the problem is small, i.e. the number of variables does not exceed 100, (b) the problem is smooth, i.e. the functions f and \(c_ j\) are continuously differentiable, (c) the problem is dense, i.e. the Hessian of the Lagrangian is dense. In particular, we do not consider problems with special structures (e.g. linearly constrained or least squares problems), and large, discrete, or nonsmooth problems. The reason for the restrictions is found in the topic of this paper, namely to investigate existing software for the general problem (NLP). The other problem types mentioned above are either specializations of (NLP) or generally applicable software does not exist.
0 references