A globally convergent matrix-free method for constrained equations and its linear convergence rate

DOI10.1155/2014/386030zbMath1470.65119OpenAlexW2120955498WikidataQ59037121 ScholiaQ59037121MaRDI QIDQ1723993

Jing Liu, Min Sun

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/386030

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical computation of solutions to systems of equations (65H10)

Related Items (1)

A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration

Cites Work

• Unnamed Item
• Unnamed Item
• Active-set projected trust-region algorithm for box-constrained nonsmooth equations
• Modified projection method for solving a system of monotone equations with convex constraints
• A PRP type method for systems of monotone equations
• A methodology for solving chemical equilibrium systems
• Spectral gradient projection method for monotone nonlinear equations with convex constraints
• A projection method for a system of nonlinear monotone equations with convex constraints
• Spectral gradient projection method for solving nonlinear monotone equations
• Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
• A NEW PROJECTION ALGORITHM FOR SOLVING A SYSTEM OF NONLINEAR EQUATIONS WITH CONVEX CONSTRAINTS
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations

This page was built for publication: A globally convergent matrix-free method for constrained equations and its linear convergence rate