A nontangential cutting plane algorithm (Q1612001)
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 nontangential cutting plane algorithm |
scientific article; zbMATH DE number 1790724
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A nontangential cutting plane algorithm |
scientific article; zbMATH DE number 1790724 |
Statements
A nontangential cutting plane algorithm (English)
0 references
28 August 2002
0 references
The author examines the cutting plane algorithm for solving the Lagrangian dual problem of a convex program. This paper demonstrates that the algorithm still converges to an optimal solution when cuts are nontangential or generated by not solving the optimality or nearly so. Computational results from randomly generated linear and quadratic programming problems indicate that nontangential cuts can lead to a more efficient algorithm.
0 references
decomposition
0 references
large-scale system
0 references
cutting plane algorithm
0 references
Lagrangian dual problem
0 references
convex program
0 references
