Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm (Q257838)
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: Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm |
scientific article; zbMATH DE number 6557492
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm |
scientific article; zbMATH DE number 6557492 |
Statements
Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm (English)
0 references
17 March 2016
0 references
unbounded conditions
0 references
nonlinear programming problems
0 references
non-convex sets
0 references
0 references
0 references
