Unconstrained optimization - Globe Thesis

Keyword [Unconstrained optimization] Result: 81 - 100 \| Page: 5 of 10
81.	Some Studies On Memory Gradient Method For Unconstrained Optimization Problems
82.	Analysis Of Numerical Algorithms For Several Classes Of Optimization Problems
83.	Study On Several New Nonlinear Conjugate Gradient Algorithms And Analyse Their Global Convergence
84.	Research On Line Search Methods And Trust Region Methods In Unconstrained Optimization
85.	Reseach Of Conjugate Gradient Methods For Unconstrained Optimization
86.	Improvement Of Conic-Model Trust Region Method For Nonlinear Optimization
87.	Convergence Of Nonlinear Conjugate Gradient Methods
88.	A Self-Adaptive Filter Trust Region Method For Unconstrained Optimization
89.	The Research On Global Convergence Of Nonlinear Conjugate Gradient Method Including Parameter
90.	Research On Penalty Function Of Constrained Optimization Problems
91.	The Nonmonotone Line Search Technique And Its Applications
92.	Research On The Filled Function Algorithms For Solving Nonlinear Global Optimization Problems
93.	Some Researches On Newton-type Algorithm For Solving Unconstrained Optimization Problems
94.	A New Class Of Quasi-newton Algorithm And Its Convergence
95.	Trust Region Algorithms Based On The Conic Model
96.	Trust-Region Algorithm Using Two-dimen-sional Subspace Technique With New Conic Model
97.	An Efficlent Method For Solving Nenlinear Unconstrained Min-max Problem
98.	A Modified Tensor Method For Singular Unconstrained Optimization
99.	A New Type Of Trust Region Method Guided By The Negative Gradient Direction
100.	The Mixed Trust Region Algorithm For Unconstrained Optimization
<<First <Prev Next> Last>> Jump to