An extended delayed weighted gradient algorithm for solving strongly convex optimization problems

DOI10.1016/j.cam.2022.114525zbMath1492.65158OpenAlexW4283259651WikidataQ113878696 ScholiaQ113878696MaRDI QIDQ2161068

L. D. Secchin, Harry Oviedo, Roberto Andreani, Marcos Raydan

Publication date: 4 August 2022

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2022.114525

zbMATH Keywords

large-scale optimizationgradient methodsconjugate gradient methodsstrongly convex functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Uses Software

• SPG
• UCI-ml
• SparseMatrix
• CG_DESCENT
• GitHub
• Optim
• BenchmarkProfiles.jl

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Barzilai-Borwein conjugate gradient method
• Gradient methods with adaptive step-sizes
• New adaptive stepsize selections in gradient methods
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
• Properties of the delayed weighted gradient method
• A delayed weighted gradient method for strictly convex quadratic minimization
• On the steplength selection in gradient methods for unconstrained optimization
• The university of Florida sparse matrix collection
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Adaptive Quadratically Regularized Newton Method for Riemannian Optimization
• Algorithm 851
• Two-Point Step Size Gradient Methods
• Algorithm 813
• Benchmarking optimization software with performance profiles.

This page was built for publication: An extended delayed weighted gradient algorithm for solving strongly convex optimization problems