Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing (Q6109887): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 19:32, 30 December 2024

scientific article; zbMATH DE number 7720454

Language	Label	Description	Also known as
English	Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing	scientific article; zbMATH DE number 7720454

Statements

scholarly article

0 references

Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing (English)

0 references

Zohre Aminifard

0 references

Saman Babaie-Kafaki

0 references

Fatemeh Dargahi

0 references

Numerical Algorithms

0 references

publication date

31 July 2023

0 references

zbMATH Keywords

nonlinear optimization

0 references

conjugate gradient method

0 references

nonmonotone line search

0 references

forgetting factor

0 references

sparse recovery

0 references

nonnegative matrix factorization

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1007/s11075-022-01477-7

0 references

Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery

0 references

A nonmonotone trust-region line search method for large-scale unconstrained optimization

0 references

On efficiency of nonmonotone Armijo-type line searches

0 references

An inexact line search approach using modified nonmonotone strategy for unconstrained optimization

0 references

A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions

0 references

0 references

Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing

0 references

0 references

A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization

0 references

A modified conjugate gradient method for monotone nonlinear equations with convex constraints

0 references

On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae

0 references

A descent family of Dai–Liao conjugate gradient methods

0 references

Two hybrid nonlinear conjugate gradient methods based on a modified secant equation

0 references

TWO MODIFIED HYBRID CONJUGATE GRADIENT METHODS BASED ON A HYBRID SECANT EQUATION

0 references

Two-Point Step Size Gradient Methods

0 references

NESTA: A Fast and Accurate First-Order Method for Sparse Recovery

0 references

Nonmonotone Spectral Projected Gradient Methods on Convex Sets

0 references

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

0 references

A conjugate gradient algorithm and its applications in image restoration

0 references

A new modified nonmonotone adaptive trust region method for unconstrained optimization

0 references

A nonmonotone conjugate gradient algorithm for unconstrained optimization

0 references

On the nonmonotone line search

0 references

A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search

0 references

New conjugacy conditions and related nonlinear conjugate gradient methods

0 references

Benchmarking optimization software with performance profiles.

0 references

A new generalized shrinkage conjugate gradient method for sparse recovery

0 references

A modified spectral conjugate gradient method with global convergence

0 references

Global Convergence Properties of Conjugate Gradient Methods for Optimization

0 references

CUTEr and SifDec

0 references

A Nonmonotone Line Search Technique for Newton’s Method

0 references

A truncated Newton method with non-monotone line search for unconstrained optimization

0 references

A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search

0 references

0 references

Methods of conjugate gradients for solving linear systems

0 references

Robust regression: Asymptotics, conjectures and Monte Carlo

0 references

Exponential convergence of recursive last squares with exponential forgetting factor

0 references

Learning the parts of objects by non-negative matrix factorization

0 references

Gradient-based variable forgetting factor RLS algorithm in time-varying environments

0 references

A class of modified FR conjugate gradient method and applications to non-negative matrix factorization

0 references

A class of nonmonotone conjugate gradient methods for unconstrained optimization

0 references

Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization

0 references

Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization

0 references

Smooth minimization of non-smooth functions

0 references

An adaptive nonmonotone trust region algorithm

0 references

Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization

0 references

Nonmonotone trust region method for solving optimization problems

0 references

Optimization theory and methods. Nonlinear programming

0 references

An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization

0 references

A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints

0 references

A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control

0 references

A CLASS OF NONMONOTONE SPECTRAL MEMORY GRADIENT METHOD

0 references

A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems

0 references

A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization

0 references

Some descent three-term conjugate gradient methods and their global convergence

0 references

Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S11075-022-01477-7

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6109887

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6109887&oldid=39705552"