Dissertation > Excellent graduate degree dissertation topics show

Theory and Algorithm Study for One Type of Feasibility Problem

Author: ZhangHongYu
Tutor: WangYiJu
School: Qufu Normal University
Course: Operational Research and Cybernetics
Keywords: The linear feasibility problem the convex feasibility problem error bound projection global convergence the R-linear convergent rate
CLC: O224
Type: Master's thesis
Year: 2009
Downloads: 9
Quote: 0
Read: Download Dissertation

Abstract


In this thesis,we mainly consider the linear feasibility problem,the convex feasibility problem respectively.The paper consists of four chapters.Chapter 1 gives an introduction of the thesis,which mainly discusses the current development of the discussed issue,i.e.the linear feasibility problem,the convex feasibility problem and furthermore,the main contribution of this paper is also listed in this chapter.In chapter 2,basing on the existing projection method for solving the linear feasibility problem,we present a new accelerated projection method by adopting a accelerated procedure and a surrogate technique.For this new method,we first prove its global convergence provided that the solution set is nonempty and then show that it is R-linearly convergent under general situation.The given preliminary computational experiments show that our modified method is efficient.In chapter 3,we present a new projection method for solving the linear feasibility problem based on the method proposed by Dudek(2007).Compared with Dudek’s iterative method of the line search procedure with fixed stepsize,our method adopts a surrogate technique to obtain the new iterative point to avoid the phenomenon of the unbounded stepsize in the iterative procedure of method. Compared with the existing method in the previous chapter,we first struct a new half-space by using the current point and the previous iteration point,then surrogate the projecting on the new half-space by the surrogate technique to shorten the distance between the new iterative point and the solution.For this new method,we first prove its global convergence provided that the solution set is nonempty.The given preliminary computational experiments show that this method has a good performance. In chapter 4,we propose a new projection method for solving the convex feasibility problem based on the method proposed by Eremin(1970).Compared with the iterative method of Eremin,the new method adopts two projections and a surrogate technique to obtain the new iterative point.For this new method, we first prove its global convergence provided that the solution set is nonempty and then show that it is R-linearly convergent under general situation.The given preliminary computational experiments show that our method is promising.

Related Dissertations

  1. Research on Secure Fingerprint Authentication Based on Distance Projection Coding,TP391.4
  2. Crop Evapotranspiration Study on Evolution Rule and Forecast Model in Chaoyang Area,S161.4
  3. High-performed Kernel Classification Methods Based on Multi-kernel Learning,TP391.41
  4. Fine geographical coordinates navigation projection technology research and application,P226.3
  5. Projection Theory of Functional Grammar and English Reading Teaching,H319
  6. Ad hoc networks are based on projection pursuit wormhole detection mechanism,TN929.5
  7. P2P network based on gray theory Behavior Analysis and Forecast,TP393.02
  8. Fabric appearance based on machine vision digital analysis method and system design,TP391.41
  9. Integration and Application of Clustering Algorithm,TP311.13
  10. Trust Region Algorithms Based on the Conic Model,O224
  11. Unconstrained Nonlinear Conjugate Gradient Method,O224
  12. Studies on Efficient Algorithms for Finite-Dimensional Variational Inequality and Complementarity Problems,O242.23
  13. A New Superlinearly Convergent Algorithm of Combining QP Subproblem with System of Linear Equations for Constrained Optimization,O241.6
  14. A New Method on Power Quality Evaluation Based on Principles of Entropy,F224
  15. 3D Reconstruction Technology Research and Development Based on 2D Image,TP391.41
  16. Research on the Infrared Imaging Real-time Simulation System in the HLA Environment for Sea-sky Background and Targets,TP391.41
  17. Research on Condensed Sequential Pattern Mining Based on Tree Structure,TP311.13
  18. A Study of Oblique Projection and Its Application in Blind Channel Estimation,TN911.5
  19. Research on Visualization of Vector Data Based on the Sphere,P208
  20. Research on Differential Measuring Method of Wire Diameter Based on Laser Projection Imaging and Its System,TN249
  21. Smoothing Newton Method for Nonlinear Programming Problem and SQP-Filter Method for Constrained Minimax Problem,O221.2

CLC: > Mathematical sciences and chemical > Mathematics > Operations Research > Optimization of the mathematical theory
© 2012 www.DissertationTopic.Net  Mobile