A big-M type method for the computation of projections onto polyhedrons (Q801817): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Numeric computation of the projection of a point onto a polyhedron / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4105489 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Direct methods for the solution of linear systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Error analysis of an algorithm for solving an undetermined linear system / rank | |||
Normal rank | |||
Latest revision as of 16:13, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A big-M type method for the computation of projections onto polyhedrons |
scientific article |
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
