Implementing proximal point methods for linear programming

Journal Article · Fri Jun 01 04:00:00 EDT 1990 · Journal of Optimization Theory and Applications; (United States)

DOI:https://doi.org/10.1007/BF00939565· OSTI ID:7008449

Wright, S J ^[1]

---

1. North Carolina State Univ., Raleigh (United States)

The authors describe the application of proximal point methods to the linear programming problem. Two basic methods are discussed. The first, which has been investigated by Mangasarian and others, is essentially the well-known method of multipliers. This approach gives rise at each iteration to a weakly convex quadratic program which may be solved inexactly using a point-SOR technique. The second approach is based on the proximal method of multipliers, originally proposed by Rockafellar, for which the quadratic program at each iteration is strongly convex. A number of techniques are used to solve this subproblem, the most promising of which appears to be a two-metric gradient-projection approach. Convergence results are given, some numerical experience is reported.

• OSTI ID: 7008449
• Journal Information: Journal of Optimization Theory and Applications; (United States), Journal Name: Journal of Optimization Theory and Applications; (United States) Vol. 65:3; ISSN JOTAB; ISSN 0022-3239
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
COMPUTERS
CONVERGENCE
CRAY COMPUTERS
DIGITAL COMPUTERS
IMPLEMENTATION
ITERATIVE METHODS
LINEAR PROGRAMMING
MATHEMATICAL LOGIC
MATHEMATICS
MATRICES
OPTIMIZATION
PROGRAMMING
SUPERCOMPUTERS