A globally convergent Newton method for convex \(SC^ 1\) minimization problems (Q1896575)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A globally convergent Newton method for convex \(SC^ 1\) minimization problems |
scientific article; zbMATH DE number 792459
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A globally convergent Newton method for convex \(SC^ 1\) minimization problems |
scientific article; zbMATH DE number 792459 |
Statements
A globally convergent Newton method for convex \(SC^ 1\) minimization problems (English)
0 references
4 September 1995
0 references
Newton method
0 references
globally convergent and locally superlinearly convergent method
0 references
convex minimization
0 references
semismooth but nondifferentiable gradient
0 references
nonlinear minimax problems
0 references
stochastic programs with recourse
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9235706
0 references
0.9188957
0 references
0.90486014
0 references
0.9039823
0 references
0.9032315
0 references
0.8974058
0 references
0.8964945
0 references
0.8934063
0 references
