A hybrid BB-type method for solving large scale unconstrained optimization (Q6138335): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 18:47, 30 December 2024

scientific article; zbMATH DE number 7734321

Language	Label	Description	Also known as
English	A hybrid BB-type method for solving large scale unconstrained optimization	scientific article; zbMATH DE number 7734321

Statements

scholarly article

0 references

A hybrid BB-type method for solving large scale unconstrained optimization (English)

0 references

0 references

0 references

Journal of Applied Mathematics and Computing

0 references

publication date

5 September 2023

0 references

zbMATH Keywords

unconstrained optimization

0 references

BB method

0 references

IMPBOT algorithm

0 references

convergence analysis

0 references

numerical experiments

0 references

MaRDI profile type

MaRDI publication profile

0 references

Optimization Methods for Large-Scale Machine Learning

0 references

A new family of hybrid three-term conjugate gradient methods with applications in image restoration

0 references

Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing

0 references

Two-Point Step Size Gradient Methods

0 references

The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem

0 references

A Nonmonotone Line Search Technique for Newton’s Method

0 references

Notes on the Dai-Yuan-Yuan modified spectral gradient method

0 references

Hybrid spectral gradient method for the unconstrained minimization problem

0 references

Scaling on the spectral gradient method

0 references

A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems

0 references

Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem

0 references

A family of spectral gradient methods for optimization

0 references

Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization

0 references

On the steplength selection in gradient methods for unconstrained optimization

0 references

An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization

0 references

An efficient gradient method with approximately optimal stepsizes based on regularization models for unconstrained optimization

0 references

A Barzilai-Borwein conjugate gradient method

0 references

Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations

0 references

Neurodynamical optimization

0 references

0 references

Trust Region Algorithms and Timestep Selection

0 references

0 references

Combining trust-region techniques and Rosenbrock methods to compute stationary points

0 references

An ODE-based nonmonotone method for unconstrained optimization problems

0 references

A hybrid trust region algorithm for unconstrained optimization

0 references

Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints

0 references

A differential equation method for solving box constrained variational inequality problems

0 references

0 references

Continuation Newton methods with the residual trust-region time-stepping scheme for nonlinear equations

0 references

A new method for solving split equality problems via projection dynamical systems

0 references

Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization

0 references

Optimization theory and methods. Nonlinear programming

0 references

New quasi-Newton methods for unconstrained optimization problems

0 references

New quasi-Newton equation and related methods for unconstrained optimization

0 references

A modified BFGS method and its global convergence in nonconvex minimization

0 references

A modified BFGS algorithm based on a hybrid secant equation

0 references

Incorporating nonmonotone strategies into the trust region method for unconstrained optimization

0 references

A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization

0 references

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

0 references

0 references

CUTEr and SifDec

0 references

Benchmarking optimization software with performance profiles.

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

10.1007/S12190-022-01826-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6138335

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