Supermemory gradient methods for monotone nonlinear equations with convex constraints
type: Item
instance of: scholarly article
title: Supermemory gradient methods for monotone nonlinear equations with convex constraints
zbMATH Open document ID: 1359.90136
author: Yuanwen Liu
author: Yigui Ou
published in: Computational and Applied Mathematics
publication date: 2017-04-03T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65H10
zbMATH DE Number: 6699572
zbMATH Keywords: monotone equations
zbMATH Keywords: supermemory gradient method
zbMATH Keywords: projection method
zbMATH Keywords: global convergence
MaRDI profile type: Publication
full work available at URL: s40314-015-0228-1
OpenAlex ID: W1984506280
cites work: Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
cites work: Benchmarking optimization software with performance profiles.
cites work: On the Levenberg-Marquardt methods for convex constrained nonlinear equations
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: Q5479892
cites work: Newton-type Methods with Generalized Distances For Constrained Optimization
cites work: A projected gradient trust-region method for solving nonlinear systems with convex constraints
cites work: A class of derivative-free methods for large-scale nonlinear monotone equations
cites work: Global convergence of a memory gradient method for unconstrained optimization
cites work: Numerical Optimization
cites work: A new supermemory gradient method for unconstrained optimization problems
cites work: A nonmonotone supermemory gradient algorithm for unconstrained optimization
cites work: A new super-memory gradient method with curve search rule
cites work: A New Projection Method for Variational Inequality Problems
cites work: A new descent memory gradient method and its global convergence
cites work: A smoothing projected Newton-type method for semismooth equations with bound constraints
cites work: A projection method for a system of nonlinear monotone equations with convex constraints
cites work: A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
cites work: A globally convergent derivative-free method for solving large-scale nonlinear monotone equations
cites work: Spectral gradient projection method for monotone nonlinear equations with convex constraints
cites work: Monotonicity of fixed point and normal mappings associated with variational inequality and its application
DOI: 10.1007/S40314-015-0228-1
description: scientific article; zbMATH DE number 6699572