A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions (Q3661324): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.8.2.185 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087803168 / rank | |||
Normal rank | |||
Latest revision as of 23:22, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions |
scientific article |
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
