An exterior point method for the convex programming problem
- 67 Downloads
This paper gives a proof of convergence of an iterative method for maximizing a concave function subject to inequality constraints involving convex functions. The linear programming problem is an important special case. The primary feature is that each iteration is very simple computationally, involving only one of the constraints. Although the paper is theoretical in nature, some numerical results are included.
Key WordsNonlinear programming convex programming gradient projections optimization
Unable to display preview. Download preview PDF.
- 1.Griffith, R. E., andStewart, R. A.,A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems, Management Science, Vol. 8, pp. 379–392, 1961.Google Scholar
- 2.Fletcher, R.,Practical Methods of Optimization, 2nd Edition, John Wiley and Sons, New York, New York, 1987.Google Scholar
- 3.Polyak, B. T.,Introduction to Optimization, Optimization Software, New York, New York, 1987.Google Scholar
- 4.Domich, P. D., Hoffman, K. L., Jackson, R. H. F., Saunders, P. S., andShier, D. R.,Comparison of Mathematical Programming Software: A Case Study Using Discrete L 1-Approximation Codes, Computers and Operations Research, Vol. 14, pp. 435–447, 1987.Google Scholar