A Subspace Study on Conjugate Gradient Algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 641552
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- A new conjugate gradient method for unconstrained optimization
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
Cites work
- Computational methods in optimization. A unified approach.
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Function minimization by conjugate gradients
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- scientific article; zbMATH DE number 3304573 (Why is no real title available?)
- Some convergence properties of the conjugate gradient method
- Testing Unconstrained Optimization Software
Cited in
(56)- A computational evaluation of two subgradient search methods
- New imperfect conjugate gradient algorithm
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- Acceleration of sequential subspace optimization in Banach spaces by orthogonal search directions
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
- A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- A class of accelerated subspace minimization conjugate gradient methods
- An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- A new conjugate gradient method with an efficient memory structure
- A subspace SQP method for equality constrained optimization
- On efficiently combining limited-memory and trust-region techniques
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- New hybrid conjugate gradient method for unconstrained optimization
- scientific article; zbMATH DE number 437444 (Why is no real title available?)
- A three-term derivative-free projection method for nonlinear monotone system of equations
- A Barzilai-Borwein conjugate gradient method
- scientific article; zbMATH DE number 3976225 (Why is no real title available?)
- scientific article; zbMATH DE number 4046982 (Why is no real title available?)
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization
- scientific article; zbMATH DE number 641552 (Why is no real title available?)
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- A family of quasi-Newton methods for unconstrained optimization problems
- On CG algorithms as objects of scientific study: An appendix
- A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Local Theory
- Optimization in ℝnby Coggin's method
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- Subspace methods in multi-parameter seismic full waveform inversion
- A Riemannian subspace limited-memory SR1 trust region method
- An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization
- A general two-level subspace method for nonlinear optimization
- A conjugate gradient method based on subset of subspace
- A fourth-order nonlinear conjugate gradient method and trust regions in unconstrained optimization
- A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model
- A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization
- A new subspace minimization conjugate gradient method for unconstrained minimization
- An overview of nonlinear optimization
- An efficient inertial subspace minimization CG algorithm with convergence rate analysis for constrained nonlinear monotone equations
- Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition
- A subspace derivative-free projection method for convex constrained nonlinear equations
- A globally convergent gradient method with momentum
- A class of new subspace minimization conjugate gradient algorithms for unconstrained optimization
- A subspace minimization conjugate gradient method for nonlinear monotone equations with convex constraints
- A subspace minimization Barzilai-Borwein method for multiobjective optimization problems
- Subspace methods for nonlinear optimization
- A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization
- An improved Dai-Liao-style hybrid conjugate gradient-based method for solving unconstrained nonconvex optimization and extension to constrained nonlinear monotone equations
- A novel subspace-minimization conjugate gradient algorithm with non-monotone line search for solving large scale unconstrained optimization problems
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations
This page was built for publication: A Subspace Study on Conjugate Gradient Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835475)
