On solving three classes of nonlinear programming problems via simple differentiable penalty functions (Q1821693): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00938528 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076493176 / rank | |||
Normal rank | |||
Latest revision as of 10:50, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On solving three classes of nonlinear programming problems via simple differentiable penalty functions |
scientific article |
Statements
On solving three classes of nonlinear programming problems via simple differentiable penalty functions (English)
0 references
1988
0 references
We consider the following classes of nonlinear programming problems: the minimization of smooth functions subject to general constraints and simple bounds on the variables; the nonlinear \(\ell _ 1\)-problem; and the minimax problem. Numerically reliable methods for solving problems in each of these classes, based upon exploiting the structure of the problem in constructing simple differentiable penalty functions, are presented.
0 references
smooth functions
0 references
simple bounds on the variables
0 references
nonlinear \(\ell _ 1\)- problem
0 references
minimax problem
0 references
quadratic penalty functions
0 references
0 references
0 references
