A hybrid quasi-Newton method with application in sparse recovery (Q2167383): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 08:07, 17 December 2024

scientific article

Language	Label	Description	Also known as
English	A hybrid quasi-Newton method with application in sparse recovery	scientific article

Statements

scholarly article

0 references

A hybrid quasi-Newton method with application in sparse recovery (English)

0 references

Saman Babaie-Kafaki

0 references

Zohre Aminifard

0 references

Saeide Ghafoori

0 references

Computational and Applied Mathematics

0 references

publication date

25 August 2022

0 references

zbMATH Keywords

unconstrained optimization

0 references

large-scale optimization

0 references

quasi-Newton update

0 references

secant equation

0 references

sparse recovery

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1007/s40314-022-01962-8

0 references

A combined class of self-scaling and modified quasi-Newton methods

0 references

Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems

0 references

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

0 references

An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix

0 references

Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length

0 references

An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing

0 references

Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization

0 references

An extended Dai-Liao conjugate gradient method with global convergence for nonconvex functions

0 references

A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization

0 references

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

0 references

A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique

0 references

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

0 references

On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence

0 references

Limited memory BFGS method based on a high-order tensor model

0 references

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

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

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

Multi-step quasi-Newton methods for optimization

0 references

CUTEr and SifDec

0 references

0 references

Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments

0 references

A modified BFGS method and its global convergence in nonconvex minimization

0 references

On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems

0 references

A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method

0 references

A descent hybrid conjugate gradient method based on the memoryless BFGS update

0 references

Approximation BFGS methods for nonlinear image restoration

0 references

A particle swarm-BFGS algorithm for nonlinear programming problems

0 references

Smooth minimization of non-smooth functions

0 references

0 references

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

0 references

Optimization theory and methods. Nonlinear programming

0 references

0 references

New quasi-Newton methods for unconstrained optimization problems

0 references

The superlinear convergence of a modified BFGS-type method for unconstrained optimization

0 references

A survey of quasi-Newton equations and quasi-Newton methods for optimization

0 references

Broad echo state network for multivariate time series prediction

0 references

Convergence analysis of a modified BFGS method on convex minimizations

0 references

A Modified BFGS Algorithm for Unconstrained Optimization

0 references

New quasi-Newton equation and related methods for unconstrained optimization

0 references

A nonlinear conjugate gradient method based on the MBFGS secant condition

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

zbMATH DE Number

0 references

0 references

10.1007/S40314-022-01962-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2167383

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