A note on solving nonlinear minimax problems via a differentiable penalty function (Q795737)
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 3862944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on solving nonlinear minimax problems via a differentiable penalty function |
scientific article; zbMATH DE number 3862944 |
Statements
A note on solving nonlinear minimax problems via a differentiable penalty function (English)
0 references
1985
0 references
The note demonstrates that modelling a nonlinear minimax problem as a nonlinear programming problem and applying a classical differentiable penalty function to attempt to solve the problem can lead to convergence to a stationary point of the penalty function which is not a feasible point of the nonlinear programming problem. This occured naturally in an application from statistical reliability theory. The note resolves the problem through modification of both the problem formulation and the iterative penalty function method.
0 references
nonlinear minimax problem
0 references
differentiable penalty function
0 references
convergence
0 references
statistical reliability theory
0 references
0.82440584897995
0 references
0.7989503741264343
0 references
0.7976401448249817
0 references
0.787606418132782
0 references