superlinear convergence - Globe Thesis

Keyword [superlinear convergence] Result: 81 - 100 \| Page: 5 of 6
81.	Nonlinear Optimization Sqp Method And Trust Region Method
82.	For Solving Nonlinear Least Squares Problem, A New Class Of Decomposition Of The Quasi-newton Method
83.	For Solving Nonlinear Constrained Optimization Problems Modified Bfgs Method
84.	Some Research About Nonmono-tone ODE-type Trust Region Method
85.	Feasibility Safeguard Methods For Nonlinear Programming With Applications
86.	Studies On The QP-Free Algorithms For Constrained Optimization
87.	A Feasible MBFGS Method For Linearly Constrained Optimization
88.	Algorithms And Convergence Analysis For Absolute Value Equations
89.	Filter Trust Region Algorithms For Unconstrained Optimization
90.	The Convergence Of Spare Quasi-Newton Method For Partially Separable Optimization Problems
91.	A New Superlinearly Convergent Norm-Relaxed Sqp Method For Constrained Minimax Problems
92.	An Improved Algorithms Of BFGS And Its Convergence Analysis
93.	A Primal-Dual Interior Point Method For Optimization Problems With Nonlinear Complementarity Constraints
94.	A New Qp-free Algorithm For Optimization With Nonlinear Complementarity Constraints
95.	Sparse Quasi-Newton Methods For Partially Separable Nonlinear Equations And Optimization Problems
96.	Quasi-newton Type Bundle Method For Nonconvex Nonsmooth Optimization
97.	Adaptive Trust Region Algorithm For Nonlinear Optimization Problems
98.	A Type Of New BFGS Algorithm
99.	A Penalty-free Line Search Method With Infeasibility Detection
100.	Study On Interior-Point Algorithms In Wide Neighborhoods For Linear Programming And Complementarity Problems
<<First <Prev Next> Last>> Jump to