Stable Barrier-Projection and Barrier-Newton Methods for Linear and Nonlinear Programming

  • Yu. G. Evtushenko
  • V. G. Zhadan
Part of the NATO ASI Series book series (ASIC, volume 434)

Abstract

A space transformation technique is used for the reduction of constrained minimization problems to minimization problems without inequality constraints. The continuous and discrete versions of stable barrier-projection method and Newton’s method are applied for solving such reduced LP and NLP problems. The space transformation modifies these methods and introduces additional matrices which play the role of a multiplicative barrier, preventing the trajectories from crossing the boundary of the feasible set. The proposed algorithms are based on the numerical integration of systems of ordinary differential equations. These algorithms do not require feasibility of starting and current points, but they preserve feasibility. Some results about convergence rate analysis for continuous and discrete versions of the methods are presented. We describe primal barrier-projection methods, primal barrier-Newton methods and primal-dual barrier-Newton methods. For LP we develop dual barrier-projection and barrier-Newton methods.

Keywords

Discrete Version Interior Point Method Constraint Qualification Gradient Projection Method Space Transformation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Adler, I., Karmarkar, N., Resende, M. and Veiga, G. (1989) An implementation of Karmarkar’s algorithm for linear programming, Mathematical Programming 44, 297–335.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    Barnes, E. (1986) A variation on Karmarkar’s algorithm for solving linear programming problems, Mathematical Programming 36, 174–182.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    Bacciotti, A. (1992) Local stability of nonlinear control systems, Series on Advances in Mathematics for Applied Sciences 8, World Scientific Publishing Co. Ptc. Ltd., Singapore.Google Scholar
  4. [4]
    Bayer, D. and Lagarias, J. (1989) The nonlinear geometry of linear programming. Affine and projective scaling trajectories, Trans. Amer. Math. Soc. 314, 499–526.MathSciNetMATHGoogle Scholar
  5. [5]
    Bertsekas, D. (1982) Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York.MATHGoogle Scholar
  6. [6]
    Dikin, I. (1967) Iterative solution of problems of linear and quadratic programming, Sov. Math. Dokl. 8, 674–675.MATHGoogle Scholar
  7. [7]
    Evtushenko, Yu. (1974) Two numerical methods of solving nonlinear programming problems, Sov. Math. Dokl. 15, 420–423.MATHGoogle Scholar
  8. [8]
    Evtushenko, Yu. (1985) Numerical Optimization Techniques. Optimization Software, Inc. Publications Division, New York.Google Scholar
  9. [9]
    Evtushenko, Yu. and Zhadan, V. (1973) Numerical methods for solving some operations research problems, U.S.S.R. Comput. Maths. Math. Phys. 13, 56–77.CrossRefGoogle Scholar
  10. [10]
    Evtushenko, Yu. and Zhadan, V. (1975) Application of the method of Lyapunov functions to the study of the convergence of numerical methods, U.S.S.R. Comput. Maths. Math. Phys. 15, 96–108.CrossRefGoogle Scholar
  11. [11]
    Evtushenko, Yu. and Zhadan, V. (1978) A relaxation method for solving problems of non-linear programming, U.S.S.R. Comput. Maths. Math. Phys. 17, 73–87.CrossRefGoogle Scholar
  12. [12]
    Evtushenko, Yu. and Zhadan, V. (1989) New approaches in optimization techniques, in H.-J. Sebastian and K. Tammer (eds.), Lecture Notes in Control and Information Sciences, 143, System Modelling and Optimization, Proc. of the 14th IFIP Conference, Springer-Verlag, Leipzig, pp. 23–37,.Google Scholar
  13. [13]
    Evtushenko, Yu. and Zhadan, V. (1991) Barrier-projective and barrier-Newton numerical methods in optimization (the nonlinear programming case), Computing Center of the USSR Academy of Sciences, Reports at Comput. Math., (in Russian).Google Scholar
  14. [14]
    Evtushenko, Yu. and Zhadan, V. (1992) Barrier-projective and barrier-Newton numerical methods in optimization (the linear programming case), Computing Center of the Russian Academy of Sciences, Reports in Comput. Math., (in Russian).Google Scholar
  15. [15]
    Evtushenko, Yu. and Zhadan, V. (1992) The space transformation techniques in mathematical programming, in: P. Kall (ed.), Lecture Notes in Control and Information Sciences, 180, System Modelling and Optimization, Proc. of the 15th IFIP Conference, Springer-Verlag, Zurich, pp. 292–300.Google Scholar
  16. [16]
    Evtushenko, Yu. and Zhadan, V. (1993) Stable barrier-projection and barrier-Newton methods in nonlinear programming. To appear in Optimization Methods and Software Google Scholar
  17. [17]
    Faybusovich, L. (1991) Dynamical systems which solve optimization problems with linear constraints, IMA Journal of Mathematical Control and Information 8, 135–149.MathSciNetMATHCrossRefGoogle Scholar
  18. [18]
    Faybusovich, L. (1991) Hamiltonian structure of dynamical systems which solve linear programming problems, Physica D 53, 217–232.MathSciNetMATHCrossRefGoogle Scholar
  19. [19]
    Fiacco, A. and McCormic, G. (1968) Nonlinear programming: Sequential unconstrained minimization techniques, John Wiley & Sons, New York.MATHGoogle Scholar
  20. [20]
    Gonzaga, C. (1992) Path following methods for linear programming, SIAM Review 34, 167–224.MathSciNetMATHCrossRefGoogle Scholar
  21. [21]
    Herzel, S., Recchioni, M. and Zirilli, F. (1991) A quadratically convergent method for linear programming, Linear Algebra and its Applications, 152, 255–289.MathSciNetMATHCrossRefGoogle Scholar
  22. [22]
    Jarre, F., Sonnevend, G. and Stoer, J. (1988) An implementation of the method of analytic centers, Lect. Notes Control and Information Sci., 111, Springer-Verlag, New York.Google Scholar
  23. [23]
    Kallio, M. (1986) On gradient projection for linear programming, Working paper 94, Yale School of Organization and Management.Google Scholar
  24. [24]
    Karmarkar, N. (1984) A new polynomial-time algorithm for linear programming, Combinatorica, No. 4, 373–395.MathSciNetMATHCrossRefGoogle Scholar
  25. [25]
    Kojima, M., Mizuno, S. and Yoshise, A. (1989) A primal-dual interior point method for linear programming, in N. Megiddo (ed.), Progress in Mathematical Programming-Interior Point and Related Methods, Springer-Verlag, Berlin, Chap. 2.Google Scholar
  26. [26]
    Luenberger, D. (1973) Introduction to linear and nonlinear programming, Addison-Wesley Publishing Company, Reading.MATHGoogle Scholar
  27. [27]
    Megiddo, N. (1989) Pathways to the optimal set in linear programming, in N. Megiddo (ed.), Progress in Mathematical Programming-Interior Point and Related Methods, Springer-Verlag, Berlin, Chap. 8.Google Scholar
  28. [28]
    Mehrotra, S. (1990) On the implementation of a (primal-dual) interior point method, Technical Report 90–03, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois.Google Scholar
  29. [29]
    Rosen, J. (1960) The gradient projection method for nonlinear programming, part 1, linear constraints, SIAM J. Applied Math. 8, 181–217.MATHCrossRefGoogle Scholar
  30. [30]
    McShane, K., Monma, C. and Shanno, D. (1989) An implementation of primal-dual interior point method for linear programming, ORSA J. Comput. 1, 70–89.MATHGoogle Scholar
  31. [31]
    Smirnov, G. Convergence of barrier-projection methods of optimization via vector Lyapunov functions, to appear in Optimization Methods and Software.Google Scholar
  32. [32]
    Smirnov, G. Complexity of the barrier-Newton method in linear programming, to appear in Optimization Methods and Software Google Scholar
  33. [33]
    Tanabe, K. (1980) A geometric method in nonlinear programming, Journal of Optimization Theory and Applications 30 181–210.MathSciNetMATHCrossRefGoogle Scholar
  34. [34]
    Vanderbei, R., Meketon, M. and Freedman, B. (1986) A modification of Karmarkar’s linear programming algorithm, Algorithmica 1, 395–407.MathSciNetMATHCrossRefGoogle Scholar
  35. [35]
    Wei Zi-luan, (1987) An interior point method for linear programming, Journal of Computing Mathematics, Oct., 342–350.Google Scholar
  36. [36]
    Ye, Y. Tapia, R. and Zhang, Y. (1991) A superlinearly convergent iteration algorithm for linear programming, Technical Report TR91–22, Rice University, Houston, Texas.Google Scholar
  37. [37]
    Zhadan, V. (1980) On two classes of methods for solving nonlinear programming problems, Sov. Math. Dokl, 22, 388–392.MATHGoogle Scholar
  38. [38]
    Zhang, Y. Tapia, R. and Dennis, J. (1990) On the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms, Technical Report TR90–6, Rice University, Houston, Texas.Google Scholar

Copyright information

© Kluwer Academic Publishers 1994

Authors and Affiliations

  • Yu. G. Evtushenko
    • 1
  • V. G. Zhadan
    • 1
  1. 1.Computing CenterMoscow GSP-1Russia

Personalised recommendations