Font Size: a A A
Keyword [Global convergence]
Result: 181 - 200 | Page: 10 of 10
181. A Smoothing Newton Method For Finding A Minimizing E1-norm Solution To A Linear Sys-tem Of Equations
182. Comparison And Improvement Of Algorithms For Linear Variational Inequalities
183. The Nonmonotone Line Search Technique And Its Applications
184. Improvement Of Trust Region Method For Nonlinear Constrained Optimization
185. Theory And Algorithm Study Of Two Kinds Of Nonlinear Bilevel Programming
186. A Modified Quasi-Newton Method And It's Convergence
187. Trust Region Algorithms Based On The Conic Model
188. A Modified SQP Algorithm For Nonlinearly Inequality Constrained Optimization
189. Studies On Efficient Algorithms For Finite-Dimensional Variational Inequality And Complementarity Problems
190. Research On Nonmonotone Trust Region Algorithms For Nonlinear Optimization
191. Trust Region Method Of New Conic Model For Nonlinearly Equality Constrained Optimization
192. Trust-Region Algorithm Using Two-dimen-sional Subspace Technique With New Conic Model
193. A Study On Semismooth Algorithm For Nonlinear Complementarity Problem
194. A Trust-rejion Method For Bound-constrained Derivative-free Optimization Problems
195. The Mixed Trust Region Algorithm For Unconstrained Optimization
196. Study On Nonlinear Conjugate Gradient Algorithms And Their Convergence
197. A New Nonmonotone BB-TR Method Based On Simple Conic Model For Large Scale Unconstrained Optimization
198. Study On Several Conjugate Gradient Methods
199. An Inexact Smoothing Newton Method For Solving P0-NCP Problems
200. Research On New SQCQP Algorithms For Inequality Constrained Optimization
  <<First  <Prev  Next>  Last>>  Jump to