A family of modified spectral projection methods for nonlinear monotone equations with convex constraint
From MaRDI portal
Publication:2214774
DOI10.1155/2020/2018243zbMath1459.65089OpenAlexW3095912490MaRDI QIDQ2214774
Lin Li, Zhensheng Yu, Peixin Li
Publication date: 10 December 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/2018243
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Methods of reduced gradient type (90C52)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the application of the spectral projected gradient method in image segmentation
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
- An efficient gradient method using the Yuan steplength
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- Practical quasi-Newton algorithms for singular nonlinear systems
- A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems
- A PRP type method for systems of monotone equations
- A spectral algorithm for large-scale systems of nonlinear monotone equations
- Superlinear convergence of a Newton-type algorithm for monotone equations
- A methodology for solving chemical equilibrium systems
- A projection method for convex constrained monotone nonlinear equations with applications
- A note on the spectral gradient projection method for nonlinear monotone equations with applications
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- Two spectral gradient projection methods for constrained equations and their linear convergence rate
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- A family of spectral gradient methods for optimization
- A derivative-free iterative method for nonlinear monotone equations with convex constraints
- Nonmonotone derivative-free methods for nonlinear equations
- A scaled derivative-free projection method for solving nonlinear monotone equations
- On the steplength selection in gradient methods for unconstrained optimization
- A projection method for a system of nonlinear monotone equations with convex constraints
- Spectral gradient projection method for solving nonlinear monotone equations
- Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application
- On spectral properties of steepest descent methods
- A class of derivative-free methods for large-scale nonlinear monotone equations
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Spectral DY-Type Projection Method for Nonlinear Monotone Systems of Equations
- Two-Point Step Size Gradient Methods
- Newton-type Methods with Generalized Distances For Constrained Optimization
- Alternate step gradient method*
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- Inexact Newton methods for the nonlinear complementarity problem
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Matching pursuits with time-frequency dictionaries
- A descent derivative-free algorithm for nonlinear monotone equations with convex constraints
- On the Barzilai and Borwein choice of steplength for the gradient method
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Benchmarking optimization software with performance profiles.
- Enriched methods for large-scale unconstrained optimization
This page was built for publication: A family of modified spectral projection methods for nonlinear monotone equations with convex constraint