A big-M type method for the computation of projections onto polyhedrons (Q801817)
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 3880449
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A big-M type method for the computation of projections onto polyhedrons |
scientific article; zbMATH DE number 3880449 |
Statements
A big-M type method for the computation of projections onto polyhedrons (English)
0 references
1985
0 references
In a previous work [ibid. 43, 495-525 (1984; Zbl 0518.65044)], we examined some active constraints methods for the computation of the projection of a point onto a polyhedron when a feasible point is known. In this paper, we assume that such a point is not known and examine a method similar to the big-M method developed for the solution of linear programming problems. Special attention is given to the study of computing error propagation.
0 references
active constraints methods
0 references
big-M method
0 references
error propagation
0 references
projection onto polyhedra
0 references
active set methods
0 references
orthogonal factorization
0 references
0.90257144
0 references
0.88032377
0 references
0.87512875
0 references
0.87512875
0 references
0.8675115
0 references
0.8603921
0 references
