Projection algorithms for linear programming (Q1199509): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Ulrich. Betke / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Pierre Loridan / rank | |||
Normal rank | |||
Revision as of 08:29, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Projection algorithms for linear programming |
scientific article |
Statements
Projection algorithms for linear programming (English)
0 references
16 January 1993
0 references
The paper is concerned with iterative projection methods for solving the feasibility problem of linear programming. The approach gives rise to a geometric interpretation based on the nearest point projection. It uses an unconstrained convex programming formulation in which it is possible to chose differentiable objective functions. A particular study of an algorithm using a variable metric method with exact line search is presented.
0 references
projection methods
0 references
feasibility problem
0 references
nearest point projection
0 references
variable metric method
0 references
exact line search
0 references
