A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
From MaRDI portal
Publication:5031726
DOI10.1080/00207160.2018.1542136zbMath1499.90232OpenAlexW2921094061MaRDI QIDQ5031726
No author found.
Publication date: 16 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2018.1542136
conjugate gradient methodtensor modelnon-monotone line searchsubspace techniqueunconstrained optimizaiton
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items
A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization, A class of accelerated subspace minimization conjugate gradient methods, Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
Uses Software
Cites Work
- A Barzilai-Borwein conjugate gradient method
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- Conjugate gradient algorithms in nonconvex optimization
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- A Modified BFGS Algorithm for Unconstrained Optimization
- An adaptive conic trust-region method for unconstrained optimization
- Tensor Methods for Nonlinear Equations
- Two-Point Step Size Gradient Methods
- Tensor Methods for Unconstrained Optimization Using Second Derivatives
- Algorithm 765: STENMIN—a software package for large, sparse unconstrained optimization using tensor methods
- Algorithm 738: a software package for unconstrained optimization using tensor methods
- Tensor Methods for Large, Sparse Unconstrained Optimization
- Tensor Methods for Large, Sparse Nonlinear Least Squares Problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Subspace Study on Conjugate Gradient Algorithms
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- The Limited Memory Conjugate Gradient Method
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
- A new efficient conjugate gradient method for unconstrained optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
