System Modelling and Optimization pp 292-300 | Cite as

# The space transformation technique in mathematical programming

- 2 Citations
- 98 Downloads

## Abstract

The present paper is devoted to the application of the space transformation technique for solving linear and nonlinear programming problems. By using a surjective mapping the initial constrained optimization problem is transformed to a problem in a new space with only equality constraints. For the numerical solution of the latter problem we use the generalized gradient-projection method and Newton’s method. After inverse transformation to the initial space we obtain the family of numerical methods for solving optimization problems with equality and inequality constraints. In the linear programming case after some simplification and after choosing a particular exponential transformation function we obtain from the proposed methods the well-known primal-dual interior point linear programming algorithm and the so-called “variation of Kermarkar’s algorithm”.

## Key words

constrained minimum problem space transformation gradient-projection method Newton’s method linear programming nonlinear programming interior point technique primal-dual method barrier function## Preview

Unable to display preview. Download preview PDF.

## References

- Barnes E.R. (1986) A variation on Karmarkar’s algorithm for solving linear programming problems. Math. Programming, 36, 174–182.zbMATHCrossRefMathSciNetGoogle Scholar
- Dikin I.I. (1967) Iterative solution of problems of linear and quadratic programming. Sov. Math. Dokl., 8, 674–675.zbMATHGoogle Scholar
- Evtushenko, Yu.G. (1974) Two numerical methods of solving nonlinear programming problems. Soviet Math. Dokl., 15, 2, 420–423.zbMATHGoogle Scholar
- Evtushenko, Yu.G. (1985) Numerical Optimization techniques. Optimization software, Inc. Publications Division, New York. 558 pp.Google Scholar
- Evtushenko, Yu.G., and V.G. Zhadan (1973) Numerical methods for solving some operations research problems. U.S.S.R. Comput. Math. Phys., 13, 3, 56–77.CrossRefGoogle Scholar
- Evtushenko, Yu.G., and V.G. Zhadan (1978) A relaxation method for solving problems of non-linear programming. U.S.S.R. Comput. Math. Phys., 17, 73–87.CrossRefGoogle Scholar
- Evtushenko, Yu.G., and V.G. Zhadan (1989) New approaches in optimization techniques. Lecture Notes in Control and Information Sciences, 143 Proc. of the 14th IFIP Conference. Leipzig: Springer-Verlag, 23–37.Google Scholar
- Evtushenko, Yu.G., and V.G. Zhadan (1991) Barrier-projective and barrier-Newton numerical methods in optimization (the nonlinear programming case). Computer Center of the USSR Academy of Sciences, Reports an Comput. Math., 64 pp. (in Russian).Google Scholar
- Kallio M. (1986) On gradient projection for linear pragramming. Working paper № 94, Yale School of Organization and Management.Google Scholar
- Karmarkar, N. (1984) A new polynomial-time algorithm for linear programming. Combinatorial. 4, 373–395.zbMATHCrossRefMathSciNetGoogle Scholar
- Rosen, J.B. (1960) The gradient projection method for nonlinear programming, part 1, linear constraints. SIAM J. Applied Mathem., 8, 181–217.zbMATHCrossRefGoogle Scholar
- Tanabe, K. (1980) A Geometric Method in Nonlinear Programming. Journal of Optimization Theory and Applications, 30, 2, 181–210.zbMATHCrossRefMathSciNetGoogle Scholar
- Zhang, Y., R.A. Tapia and Y.E.Dennis (1990) On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms. Technical Report TR90-6, Dept. Mathematical Sciences, Rice University, 31 pp.Google Scholar
- Zi-Luan, W. (1987) An interior point method for linear programming. Journal of computing mathematics, Oct., 342–350.Google Scholar