A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem
From MaRDI portal
Publication:2287031
DOI10.1007/s41980-019-00250-2zbMath1434.90142OpenAlexW2952568639MaRDI QIDQ2287031
Publication date: 23 January 2020
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41980-019-00250-2
Convex programming (90C25) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (3)
A unified convergence analysis of the derivative-free projection-based method for constrained nonlinear monotone equations ⋮ General six-step discrete-time Zhang neural network for time-varying tensor absolute value equations ⋮ A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New hybrid conjugate gradient projection method for the convex constrained equations
- A modified Hestenes-Stiefel projection method for constrained nonlinear equations and its linear convergence rate
- The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
- A modified Fletcher-Reeves-type derivative-free method for symmetric nonlinear equations
- A parametric periodic Lyapunov equation with application in semi-global stabilization of discrete-time periodic systems subject to actuator saturation
- A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
- A PRP type method for systems of monotone equations
- A new derivative-free SCG-type projection method for nonlinear monotone equations with convex constraints
- A methodology for solving chemical equilibrium systems
- A new descent memory gradient method and its global convergence
- Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints
- New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and 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
- Discrete-time Zhang neural networks for time-varying nonlinear optimization
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- Three derivative-free projection methods for nonlinear equations with convex constraints
- Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations
- A family of conjugate gradient methods for large-scale nonlinear equations
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Optimization theory and methods. Nonlinear programming
- Spectral gradient projection method for solving nonlinear monotone equations
- A class of derivative-free methods for large-scale nonlinear monotone equations
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Two-Point Step Size Gradient Methods
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- A Two-Term PRP-Based Descent Method
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
This page was built for publication: A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem
