A projected conjugate gradient method for sparse minimax problems (Q1315210)
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 510208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A projected conjugate gradient method for sparse minimax problems |
scientific article; zbMATH DE number 510208 |
Statements
A projected conjugate gradient method for sparse minimax problems (English)
0 references
24 February 1994
0 references
The author presents a trust region type first order method based on sequential linear programming for solving nonlinear minimax problems. Numerical results show that this method has considerable improvement over other first order methods.
0 references
nonlinear minimax problems
0 references
conjugate gradients
0 references
trust region methods
0 references
numerical results
0 references
first order method
0 references
sequential linear programming
0 references
0 references
0 references
0.8077003359794617
0 references
0.7924483418464661
0 references
0.7869530916213989
0 references
0.7824428677558899
0 references
