Dissertation > Excellent graduate degree dissertation topics show

Study of the Interior Point Algorithm for the Generalized Complementarity Problem

Author: WangYingNi
Tutor: WangYiJu
School: Qufu Normal University
Course: Operational Research and Cybernetics
Keywords: The generalized linear complementarity problem convex quadratic problem predictor corrector interior point algorithm quadratic convergence the generalized nonlinear complementarity problem nonlinear equations problem perturbation Newton interior point algorithm superlinear convergence
CLC: O221.2
Type: Master's thesis
Year: 2009
Downloads: 37
Quote: 0
Read: Download Dissertation

Abstract


In this thesis,we mainly consider the interior point algorithm for the generalized linear complementarity problem(GLCP),the generalized nonlinear complementarity problem over a polyhedral cone.The paper consists of three Chapters.Chapter 1 gives an introduction of the thesis,which mainly discusses the current development of our concerned problem,i.e.,the generalized complementarity problem over a polyhedral cone,and the main contribution of this paper is also listed in this chapter.In Chapter 2,we propose a predictor-corrector interior point algorithm for the generalized linear complementarity problem over a polyhedral cone.To this end,we first reformulate GLCP as a standard convex quadratic problem,then establish the relationship between the solution of the GLCP and the convex quadratic problem under some assumptions;finally,we establish a predictor-corrector interior point algorithm for the convex quadratic problem and prove the quadratic convergence of the proposed method.In Chapter 3,we present a path-following perturbation Newton interior point algorithm for the generalized nonlinear complementarity problem over a polyhedral cone.For the generalized nonlinear complementarity problem over a polyhedral cone,we first reformulate it as the constrained nonlinear equations problem, then we give a path-following perturbation Newton interior point algorithm for the constrained nonlinear equations problem.The superlinear convergence of the proposed method is also established.

Related Dissertations

  1. Conditions for the Superlinear Convergence of Quasi-Newton Methods on Degenerate Solutions,O224
  2. A New Superlinearly Convergent Algorithm of Combining QP Subproblem with System of Linear Equations for Constrained Optimization,O241.6
  3. Smoothing Newton Method for Nonlinear Programming Problem and SQP-Filter Method for Constrained Minimax Problem,O221.2
  4. A Nonmonotone Smoothing Newton Algorithm for Solving Zero-one Nonlinear Integer Programming Problems,O221.4
  5. A Modified SQP Algorithm for Nonlinearly Inequality Constrained Optimization,O224
  6. Study of Several Algorithms for Solving Nonlinear Optimization Problems,O221.2
  7. A Modified Quasi-Newton Method and It’s Convergence,O224
  8. A New Class of Quasi-newton Algorithm and Its Convergence,O224
  9. Nonsingularity Study of the Parametric FB System for Nonlinear Semidefinite Programming,O221.2
  10. Research on the SQP Algorithm for Mathematical Programs with Equilibrium Constraints,O221
  11. Nonlinear complementarity problems and nonlinear equations Smoothing Algorithm,O224
  12. Some Researches on the Smoothing Broyden-like Algorithms for Solving Complementarity Problems,O241.7
  13. Research on Smoothing Methods for Mathematical Programs with Equilibrium Constraints,O221
  14. The Study of Projection-type Algorithms for Mathematical Programming with Equilibrium Constraints,O221
  15. Research on the Superlinearly Convergent Algorithms for Optimization with Equilibrium Constraints,O221.2
  16. Analysis of Numerical Algorithms for Several Classes of Optimization Problems,O224
  17. PSB Method for Symmetric Nonlinear Equations,O241.6
  18. The Smoothing Adaptive Trust Region Method for the Nonlinear Complementarity Problem,O224
  19. A Class of Modified Gradient Projection Algorithms for Convex Constrained Problems,O224
  20. Smoothing Newton Methods for Sloving e1 Norm Optimization Model,O224
  21. Newton Methods for Inverse Problems of Linear Programming and Quadratic Programming,O221.1

CLC: > Mathematical sciences and chemical > Mathematics > Operations Research > Planning Theory ( mathematical programming) > Nonlinear Programming
© 2012 www.DissertationTopic.Net  Mobile