Three derivative-free projection methods for nonlinear equations with convex constraints

DOI10.1007/s12190-014-0774-5zbMath1348.90630OpenAlexW1985930849MaRDI QIDQ2354200

Jing Liu, Min Sun

Publication date: 10 July 2015

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-014-0774-5

zbMATH Keywords

global convergenceprojection methodnonlinear equationsderivative-free method

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (14)

A globally convergent projection method for a system of nonlinear monotone equations ⋮ New hybrid conjugate gradient projection method for the convex constrained equations ⋮ A scaled derivative-free projection method for solving nonlinear monotone equations ⋮ A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications ⋮ New three-term conjugate gradient algorithm for solving monotone nonlinear equations and signal recovery problems ⋮ A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications ⋮ A projection-based hybrid PRP-DY type conjugate gradient algorithm for constrained nonlinear equations with applications ⋮ A modified spectral gradient projection-based algorithm for large-scale constrained nonlinear equations with applications in compressive sensing ⋮ A convergence analysis of hybrid gradient projection algorithm for constrained nonlinear equations with applications in compressed sensing ⋮ Two spectral gradient projection methods for constrained equations and their linear convergence rate ⋮ A diagonal PRP-type projection method for convex constrained nonlinear monotone equations ⋮ A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem ⋮ Self adaptive spectral conjugate gradient method for solving nonlinear monotone equations ⋮ Unnamed Item

Uses Software

• MCPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Complementarity problems over cones with monotone and pseudomonotone maps
• A smoothing projected Newton-type method for semismooth equations with bound constraints
• Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints
• 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
• The Lagrangian globalization method for nonsmooth constrained equations
• Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
• Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
• A NEW PROJECTION ALGORITHM FOR SOLVING A SYSTEM OF NONLINEAR EQUATIONS WITH CONVEX CONSTRAINTS
• A Two-Term PRP-Based Descent Method
• Computing the Ehrhart quasi-polynomial of a rational simplex
• Benchmarking optimization software with performance profiles.

This page was built for publication: Three derivative-free projection methods for nonlinear equations with convex constraints