A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
From MaRDI portal
Publication:2322338
Recommendations
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- A Subspace Study on Conjugate Gradient Algorithms
- A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
Cites work
- A Barzilai-Borwein conjugate gradient method
- A conic trust-region method for nonlinearly constrained optimization
- A Modified BFGS Algorithm for Unconstrained Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A review on subspace methods for nonlinear optimization
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- A Subspace Study on Conjugate Gradient Algorithms
- A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
- A survey of nonlinear conjugate gradient methods
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- Algorithm 851
- An accelerated subspace minimization three-term conjugate gradient algorithm for 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
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- Conic Approximations and Collinear Scalings for Optimizers
- CUTEr and SifDec
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Function minimization by conjugate gradients
- scientific article; zbMATH DE number 3896207 (Why is no real title available?)
- scientific article; zbMATH DE number 1234743 (Why is no real title available?)
- scientific article; zbMATH DE number 2063451 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Interpolation by conic model for unconstrained optimization
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- Some modified conjugate gradient methods for unconstrained optimization
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The conjugate gradient method in extremal problems
- The Limited Memory Conjugate Gradient Method
- Two-Point Step Size Gradient Methods
Cited in
(16)- 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
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- A class of accelerated subspace minimization conjugate gradient methods
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- scientific article; zbMATH DE number 641552 (Why is no real title available?)
- A Subspace Study on Conjugate Gradient Algorithms
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- A conjugate gradient method based on subset of subspace
- An alternative three-dimensional subspace method based on conic model for unconstrained optimization
- A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization
- A new subspace minimization conjugate gradient method for unconstrained minimization
- An efficient inertial subspace minimization CG algorithm with convergence rate analysis for constrained nonlinear monotone equations
- A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization
- A novel subspace-minimization conjugate gradient algorithm with non-monotone line search for solving large scale unconstrained optimization problems
This page was built for publication: A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322338)
