A modified nonmonotone BFGS algorithm for unconstrained optimization (Q2400759)

scientific article

Language	Label	Description	Also known as
English	A modified nonmonotone BFGS algorithm for unconstrained optimization	scientific article

Statements

instance of

scholarly article

0 references

title

A modified nonmonotone BFGS algorithm for unconstrained optimization (English)

0 references

zbMATH Open document ID

1372.65179

0 references

DOI

10.1186/s13660-017-1453-5

0 references

0 references

0 references

0 references

Journal of Inequalities and Applications

0 references

publication date

30 August 2017

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

BFGS update

0 references

global convergence

0 references

superlinear convergence

0 references

Broyden-Fletcher-Goldfarb-Shanno algorithm

0 references

unconstrained optimization

0 references

nonmonotone line search

0 references

numerical result

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1186/s13660-017-1453-5

0 references

OpenAlex ID

W2742802560

0 references

cites work

A new trust-region method with line search for solving symmetric nonlinear equations

0 references

A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations

0 references

THE BARZILAI AND BORWEIN GRADIENT METHOD WITH NONMONOTONE LINE SEARCH FOR NONSMOOTH CONVEX OPTIMIZATION PROBLEMS

0 references

A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs

0 references

Limited memory BFGS method with backtracking for symmetric nonlinear equations

0 references

A BFGS trust-region method for nonlinear equations

0 references

Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization

0 references

A BFGS algorithm for solving symmetric nonlinear equations

0 references

A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations

0 references

A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization

0 references

A note on minimization problems and multistep methods

0 references

One-step and multistep procedures for constrained minimization problems

0 references

Differential optimization techniques

0 references

A class of gradient unconstrained minimization algorithms with adaptive stepsize

0 references

Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems

0 references

New line search methods for unconstrained optimization

0 references

A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems

0 references

The Convergence of a Class of Double-rank Minimization Algorithms

0 references

A new approach to variable metric algorithms

0 references

A Family of Variable-Metric Methods Derived by Variational Means

0 references

Conditioning of Quasi-Newton Methods for Function Minimization

0 references

On the Local and Superlinear Convergence of Quasi-Newton Methods

0 references

A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization

0 references

Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems

0 references

Quasi-Newton Methods, Motivation and Theory

0 references

A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods

0 references

Convergence Properties of the BFGS Algoritm

0 references

The BFGS method with exact line searches fails for non-convex objective functions

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

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

0 references

New quasi-Newton methods for unconstrained optimization problems

0 references

Convergence analysis of a modified BFGS method on convex minimizations

0 references

New quasi-Newton equation and related methods for unconstrained optimization

0 references

MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION

0 references

Variable Metric Method for Minimization

0 references

A New Algorithm for Unconstrained Optimization

0 references

Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search

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 class on nonmonotone stabilization methods in unconstrained optimization

0 references

Global convergece of the bfgs algorithm with nonmonotone linesearch<sup>∗</sup><sup>∗</sup>this work is supported by national natural science foundation$ef:

0 references

Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions

0 references

The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions

0 references

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

0 references

An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization

0 references

A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization

0 references

Q4776780

0 references

Testing Unconstrained Optimization Software

0 references

Benchmarking optimization software with performance profiles.

0 references

Q5569992

0 references

Q4840557

0 references

A conjugate gradient method with descent direction for unconstrained optimization

0 references

BFGS trust-region method for symmetric nonlinear equations

0 references

CUTEr and SifDec

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2400759