Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
type: Item
instance of: scholarly article
title: Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
author: Yanyan Li
published in: Numerical Algorithms
publication date: 2022-11-22T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7621829
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: regularization model
zbMATH Keywords: subspace minimization
zbMATH Keywords: Kurdyka-Łojasiewicz property
zbMATH Keywords: convergence
describes a project that uses: L-BFGS
describes a project that uses: SifDec
describes a project that uses: CG_DESCENT
describes a project that uses: CUTEr
MaRDI profile type: Publication
full work available at URL: s11075-022-01319-6
OpenAlex ID: W4280609174
cites work: On global minimizers of quadratic functions with cubic regularization
cites work: An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
cites work: Two-Point Step Size Gradient Methods
cites work: Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares
cites work: Strong local convergence properties of adaptive regularized methods for nonlinear least squares
cites work: On the use of iterative methods in cubic regularization for unconstrained optimization
cites work: A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
cites work: Modified two-point stepsize gradient methods for unconstrained optimization
cites work: A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
cites work: A Barzilai-Borwein conjugate gradient method
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Benchmarking optimization software with performance profiles.
cites work: Function minimization by conjugate gradients
cites work: CUTEr and SifDec
cites work: Updating the regularization parameter in the adaptive cubic regularization algorithm
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: Q5479892
cites work: Algorithm 851
cites work: The Limited Memory Conjugate Gradient Method
cites work: Methods of conjugate gradients for solving linear systems
cites work: A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
cites work: A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
cites work: An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
cites work: An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
cites work: On the limited memory BFGS method for large scale optimization
cites work: Relatively Smooth Convex Optimization by First-Order Methods, and Applications
cites work: Numerical Optimization
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: A class of accelerated subspace minimization conjugate gradient methods
cites work: Q4221476
cites work: A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
cites work: A subspace conjugate gradient algorithm for large-scale unconstrained optimization
cites work: A Modified BFGS Algorithm for Unconstrained Optimization
cites work: A Subspace Study on Conjugate Gradient Algorithms
cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
cites work: New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
DOI: 10.1007/S11075-022-01319-6
description: scientific article; zbMATH DE number 7621829