A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
From MaRDI portal
Publication:2413500
DOI10.1007/S11075-017-0434-6zbMath1395.90225OpenAlexW2767148939MaRDI QIDQ2413500
Publication date: 14 September 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-017-0434-6
unconstrained optimizationglobal convergenceconjugate gradient methodnonmonotone line searchsubspace minimization
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items (8)
A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization ⋮ A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization ⋮ A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization ⋮ A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization ⋮ A class of accelerated subspace minimization conjugate gradient methods ⋮ New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization ⋮ A subspace minimization conjugate gradient method based on conic model for unconstrained optimization ⋮ Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On three-term conjugate gradient algorithms for unconstrained optimization
- A Barzilai-Borwein conjugate gradient method
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- A Riemannian subspace limited-memory SR1 trust region method
- 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 gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Krylov-Subspace Recycling via the POD-Augmented Conjugate-Gradient Method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A Modified BFGS Algorithm for Unconstrained Optimization
- A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach
- A Subspace Minimization Method for the Trust-Region Step
- Two-Point Step Size Gradient Methods
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
- 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
- The conjugate gradient method in extremal problems
- Subspace Trust‐Region Methods for Large Bound‐Constrained Nonlinear Equations
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
This page was built for publication: A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
