Dissertation > Excellent graduate degree dissertation topics show
BFGS Method for Nonlinear Monotone Equations with Convex Constraints
Author: ZuoHuaLi
Tutor: WangZhiGuo;XiaoYunHai
School: Henan University
Course: Applied Mathematics
Keywords: Nonlinear equations Quasi-Newton method BFGS method Limited memory BFGS method Global Convergence
CLC: O224
Type: Master's thesis
Year: 2010
Downloads: 52
Quote: 0
Read: Download Dissertation
Abstract
|
This thesis solving nonlinear monotone equations BFGS algorithm convex constraints and limited memory BFGS algorithm , to establish the convergence of the algorithm , and solving unconstrained optimization problems , and non-linear numerical experiments verify the effectiveness of the algorithm . equations , quasi-Newton algorithm on the research and development status of the BFGS and limited memory BFGS method ; brief theoretical foundation convex function convex set . proposed solving convex constrained nonlinear monotone equations BFGS method the important feature of this algorithm is no need to calculate the the equations Jocobian matrix ; no need to solve a linear system sub - questions to determine the search direction , and thus can be used to solve the non-smooth equations under appropriate conditions , we demonstrate that the algorithm global convergence through numerical experiments verify the effectiveness of the algorithm . proposed solving convex constrained nonlinear monotone equations limited memory BFGS method , compared to the algorithm in the second chapter , the chapter mentioned algorithm does not require storage matrix , save storage space , speed up the algorithm runs , to improve the numerical efficiency , and thus more likely to be applied to solve large-scale problems . Finally, to prove the global convergence of the algorithm , and large-scale problem of algorithm testing , validation the effectiveness of the algorithm . fourth chapter gives the summary of the thesis , and some continue to explore the direction .
|
Related Dissertations
- Spectral-scaling Quasi-newton Method for Solving Nonlinear Monotone Equations,O241.6
- A New Class of Quasi-newton Algorithm and Its Convergence,O224
- Deformation monitoring data processing model based on wavelet theory research,TU196.1
- Algorithm Study for a Kind of the Variational Inequality Problem and the Split Feasibility Problem,O221
- Newton-type Methods for Solving Semi-infinite Programming Problems,O221.2
- A class of non- monotonic correction Quasi-Newton algorithm and its convergence analysis,O242.23
- Study of Several Algorithms for Solving Nonlinear Optimization Problems,O221.2
- The Improvement of Nonlinear Conjugate Gradient Methods,O224
- A Modified SQP Algorithm for Nonlinearly Inequality Constrained Optimization,O224
- Research on Nonmonotone Trust Region Algorithms for Nonlinear Optimization,O224
- Trust-Region Algorithm Using Two-dimen-sional Subspace Technique with New Conic Model,O221.2
- Microarray Feature Selection and Classification Methods,TN492
- Trust Region Method of New Conic Model for Nonlinearly Equality Constrained Optimization,O221.2
- Theory and Algorithm Study of Two Kinds of Nonlinear Bilevel Programming,O221.2
- Smoothing Newton Method for Nonlinear Programming Problem and SQP-Filter Method for Constrained Minimax Problem,O221.2
- Some Methods for Solving Multinomial Equation Systems,O174.14
- MPRP and TMPRP Type Methods for the Optimization Problems with Nonnegative Constraints,O224
- Electrical properties of the organic semiconductor material and the calculation of the concentration of carriers and analyzed,TN304
- Research on Geometric Constraint Modeling and Solving Technology,TP391.72
- A High-Order Derivative Free Iteration Method for Solving Nonlinear Equations,O241.7
- Smoothing Newton Method for Inverse Semi-definite Quadratic Programming Problems,O221.2
CLC: > Mathematical sciences and chemical > Mathematics > Operations Research > Optimization of the mathematical theory
© 2012 www.DissertationTopic.Net Mobile
|