Two improved conjugate gradient methods with application in compressive sensing and motion control
From MaRDI portal
Publication:6534631
DOI10.1155/2020/9175496zbMATH Open1544.90192MaRDI QIDQ6534631
Publication date: 14 May 2021
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 gradient-related algorithm with inexact line searches
- A parametric periodic Lyapunov equation with application in semi-global stabilization of discrete-time periodic systems subject to actuator saturation
- Efficient generalized conjugate gradient algorithms. I: Theory
- A PRP type method for systems of monotone equations
- General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization
- Superlinear convergence of a Newton-type algorithm for monotone equations
- A new descent memory gradient method and its global convergence
- 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
- General five-step discrete-time Zhang neural network for time-varying nonlinear optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- A projection method for a system of nonlinear monotone equations with convex constraints
- Spectral gradient projection method for solving nonlinear monotone equations
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- 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
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Methods of conjugate gradients for solving linear systems
- Iterative algorithms for symmetric positive semidefinite solutions of the Lyapunov matrix equations
Related Items (2)
Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing ⋮ A viscosity-type scheme for optimization problems in Hadamard spaces with applications
This page was built for publication: Two improved conjugate gradient methods with application in compressive sensing and motion control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6534631)
