Abstracto

A Nonmonotone Line Search combination algorithm for unconstrained optimization problems

Ping Hu, Xiaocai Wang


In this paper we propose a nonmonotone line search combination rule for unconstrained optimization problems and show that it possesses the global convergence property. We establish the corresponding algorithm and illustrate its effectiveness by virtue of some numerical tests. Simulation results indicate that the proposed method is very effective


Descargo de responsabilidad: este resumen se tradujo utilizando herramientas de inteligencia artificial y aún no ha sido revisado ni verificado.

Indexado en

  • CAS
  • Google Académico
  • Abrir puerta J
  • Infraestructura Nacional del Conocimiento de China (CNKI)
  • CiteFactor
  • Cosmos SI
  • Directorio de indexación de revistas de investigación (DRJI)
  • Laboratorios secretos de motores de búsqueda
  • Pub Europeo
  • ICMJE

Ver más

Flyer