A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions (Q3661324)
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 Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions |
scientific article; zbMATH DE number 3813359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions |
scientific article; zbMATH DE number 3813359 |
Statements
A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions (English)
0 references
1983
0 references
globally and superlinearly convergent algorithm
0 references
one-dimensional constrained minimization
0 references
linear approximation of constrained function
0 references
penalized polyhedral step
0 references
