Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing (Q2083385): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 00:22, 17 December 2024

scientific article

Language	Label	Description	Also known as
English	Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing	scientific article

Statements

scholarly article

0 references

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

0 references

Zohre Aminifard

0 references

Saman Babaie-Kafaki

0 references

Journal of Industrial and Management Optimization

0 references

publication date

10 October 2022

0 references

zbMATH Keywords

unconstrained optimization

0 references

large-scale optimization

0 references

quasi-Newton update

0 references

scaling

0 references

compressed sensing

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.3934/jimo.2021191

0 references

Numerical expirience with a class of self-scaling quasi-Newton algorithms

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

A robust multi-batch L-BFGS method for machine learning

0 references

A new structured quasi-Newton algorithm using partial information on Hessian

0 references

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

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

A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization

0 references

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

0 references

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

0 references

A modified scaling parameter for the memoryless BFGS updating formula

0 references

A hybrid scaling parameter for the scaled memoryless BFGS method based on the ℓ<sub>∞</sub> matrix norm

0 references

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

0 references

A modified scaled conjugate gradient method with global convergence for nonconvex functions

0 references

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

0 references

A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors

0 references

Two-Point Step Size Gradient Methods

0 references

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

0 references

New conjugacy conditions and related nonlinear conjugate gradient methods

0 references

Convergence theory for the structured BFGS secant method with an application to nonlinear least squares

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

A Nonmonotone Line Search Technique for Newton’s Method

0 references

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

0 references

Self-Scaling Variable Metric (SSVM) Algorithms

0 references

Optimal conditioning of self-scaling variable Metric algorithms

0 references

Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm

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

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

A Modified BFGS Algorithm for Unconstrained Optimization

0 references

New quasi-Newton equation and related methods for unconstrained optimization

0 references

A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems

0 references

A nonlinear conjugate gradient method based on the MBFGS secant condition

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.3934/JIMO.2021191

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2083385

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