A class of globally convergent optimization methods based on conservative convex separable approximations (Q2784424)
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 class of globally convergent optimization methods based on conservative convex separable approximations |
scientific article; zbMATH DE number 1732315
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of globally convergent optimization methods based on conservative convex separable approximations |
scientific article; zbMATH DE number 1732315 |
Statements
23 April 2002
0 references
nonlinear programming
0 references
constrained minimization
0 references
convex approximations
0 references
method of moving asymptotes
0 references
A class of globally convergent optimization methods based on conservative convex separable approximations (English)
0 references
