An algorithm for solving convex programs subject to box constraints (Q2762845)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1689555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for solving convex programs subject to box constraints |
scientific article; zbMATH DE number 1689555 |
Statements
13 January 2002
0 references
convex programming
0 references
box constraints
0 references
iterative methods
0 references
An algorithm for solving convex programs subject to box constraints (English)
0 references
There is proposed a method for solving convex programs with linear constraints and bounds on the variables. The algorithm finishes in a finite number of iterations.
0 references
