Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions (Q4742570): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:09, 7 February 2024
scientific article; zbMATH DE number 3797508
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions |
scientific article; zbMATH DE number 3797508 |
Statements
Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions (English)
0 references
1982
0 references
polyhedral approximation
0 references
nonsmooth optimization
0 references
univariate optimization
0 references
quadratic approximation
0 references
superlinear convergence
0 references
local piece-wise linear approximation
0 references
unconstrained minimization problem
0 references
polyhedral method
0 references
subgradient
0 references
