On the convergence of a new hybrid projection algorithm

DOI10.1007/s11424-006-0423-7zbMath1118.49302OpenAlexW2031040268MaRDI QIDQ882531

Qian Liu, Yang, Xinmin, Chang-Yu Wang

Publication date: 24 May 2007

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-006-0423-7

zbMATH Keywords

unconstrained optimizationglobal convergencehybrid projection

Mathematics Subject Classification ID

Newton-type methods (49M15)

Related Items (1)

A new descent memory gradient method and its global convergence

Cites Work

• Unnamed Item
• Unnamed Item
• A class of globally convergent conjugate gradient methods
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A truncated Newton method with non-monotone line search for unconstrained optimization
• Two facts on the convergence of the Cauchy algorithm
• Study on a supermemory gradient method for the minimization of functions
• Convergence of the steepest descent method for minimizing quasiconvex functions
• A New Projection Method for Variational Inequality Problems
• Engineering and Economic Applications of Complementarity Problems
• A Nonmonotone Line Search Technique for Newton’s Method
• Full convergence of the steepest descent method with inexact line searches
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem

This page was built for publication: On the convergence of a new hybrid projection algorithm