A globally convergent Newton method for convex \(SC^ 1\) minimization problems (Q1896575): 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/bf02193060 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082746403 / rank | |||
Normal rank | |||
Latest revision as of 09:46, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A globally convergent Newton method for convex \(SC^ 1\) minimization problems |
scientific article |
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
