A new spectral conjugate gradient method for large-scale unconstrained optimization
From MaRDI portal
Publication:5268934
DOI10.1080/10556788.2016.1225213zbMATH Open1365.90201OpenAlexW2527593140MaRDI QIDQ5268934FDOQ5268934
Authors: Xianzhen Jiang, You-fang Zeng, Jiang-Hua Yin, Jinbao Jian, Qi'an Chen 
Publication date: 21 June 2017
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1225213
Recommendations
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- A new spectral conjugate gradient method
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- Two classes of spectral conjugate gradient methods for unconstrained optimizations
global convergencenumerical experimentslarge-scale unconstrained optimizationspectral conjugate gradient method
Cites Work
- CUTE
- Benchmarking optimization software with performance profiles.
- Function minimization by conjugate gradients
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Scaled conjugate gradient algorithms for unconstrained optimization
- 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
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
- A spectral conjugate gradient method for unconstrained optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Convergence properties of the Fletcher-Reeves method
- Two modified scaled nonlinear conjugate gradient methods
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
Cited In (32)
- Two classes of spectral conjugate gradient methods for unconstrained optimizations
- Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems
- Two classes of spectral three-term derivative-free method for solving nonlinear equations with application
- A family of accelerated hybrid conjugate gradient method for unconstrained optimization and image restoration
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- Two families of self-adjusting spectral hybrid DL conjugate gradient methods and applications in image denoising
- A family of spectral conjugate gradient methods with strong convergence and its applications in image restoration and machine learning
- An inertial spectral CG projection method based on the memoryless BFGS update
- Title not available (Why is that?)
- Spectral conjugate gradient methods for vector optimization problems
- An improved inertial projection method for solving convex constrained monotone nonlinear equations with applications
- A new structured spectral conjugate gradient method for nonlinear least squares problems
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
- A spectral three-term Hestenes-Stiefel conjugate gradient method
- A new accelerated conjugate gradient method for large-scale unconstrained optimization
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation
- Title not available (Why is that?)
- Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization
- A hybrid Riemannian conjugate gradient method for nonconvex optimization problems
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- Least-squares-based three-term conjugate gradient methods
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
- A spectral conjugate gradient projection algorithm to solve the large-scale system of monotone nonlinear equations with application to compressed sensing
- New spectral PRP conjugate gradient method for unconstrained optimization
- Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems
- A three-term conjugate gradient method with accelerated subspace quadratic optimization
- Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing
- A modified spectral conjugate gradient method with global convergence
This page was built for publication: A new spectral conjugate gradient method for large-scale unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268934)
