Derivative-free method based on DFP updating formula for solving convex constrained nonlinear monotone equations and application

DOI10.3934/MATH.2021510zbMath1485.90129OpenAlexW3167010197MaRDI QIDQ2130906

Yanyan Li

Publication date: 25 April 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2021510

zbMATH Keywords

quasi-Newton methodderivative-free methodnonlinear monotone equationsDFP methodhyperplane projection techniquesignal reconstruction problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Methods of quasi-Newton type (90C53)

Related Items (5)

A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations ⋮ A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications ⋮ Unnamed Item ⋮ Stabilized BB projection algorithm for large-scale convex constrained nonlinear monotone equations to signal and image processing problems ⋮ A derivative-free memoryless Broyden family projection method for solving nonlinear monotone systems with convex constrains

Cites Work

• Unnamed Item
• Unnamed Item
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
• A spectral algorithm for large-scale systems of nonlinear monotone equations
• Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints
• A projection method for convex constrained monotone nonlinear equations with applications
• A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
• Spectral modified Polak-Ribiére-Polyak projection conjugate gradient method for solving monotone systems of nonlinear equations
• A composite iterative procedure with fast convergence rate for the progressive-iteration approximation of curves
• A derivative-free iterative method for nonlinear monotone equations with convex constraints
• An improved diagonal Jacobian approximation via a new quasi-Cauchy condition for solving large-scale systems of nonlinear equations
• A diagonal quasi-Newton updating method for unconstrained optimization
• Scaled conjugate gradient algorithms for unconstrained optimization
• Optimization theory and methods. Nonlinear programming
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Technical Note—A Modified Conjugate Gradient Algorithm
• The Quasi-Cauchy Relation and Diagonal Updating
• Inexact Newton methods for the nonlinear complementarity problem
• A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ₁regularized problem
• An Inexact PRP Conjugate Gradient Method for Symmetric Nonlinear Equations
• The conjugate gradient method in extremal problems
• Benchmarking optimization software with performance profiles.

This page was built for publication: Derivative-free method based on DFP updating formula for solving convex constrained nonlinear monotone equations and application