A projected conjugate gradient method for sparse minimax problems (Q1315210): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LANCELOT / rank | |||
Normal rank | |||
Revision as of 12:32, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A projected conjugate gradient method for sparse minimax problems |
scientific article |
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
