Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
From MaRDI portal
(Redirected from Publication:2098802)
Recommendations
- New subspace minimization conjugate gradient methods based on regularization model 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
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 1234743 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A Barzilai-Borwein conjugate gradient method
- A Modified BFGS Algorithm for Unconstrained Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Subspace Study on Conjugate Gradient Algorithms
- A class of accelerated subspace minimization conjugate gradient methods
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- 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 subspace conjugate gradient algorithm for large-scale unconstrained optimization
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- A survey of nonlinear conjugate gradient methods
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- 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
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Convergence of a regularized Euclidean residual algorithm for nonlinear least-squares
- Function minimization by conjugate gradients
- Methods of conjugate gradients for solving linear systems
- Modified two-point stepsize gradient methods for unconstrained optimization
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Numerical Optimization
- On global minimizers of quadratic functions with cubic regularization
- On the limited memory BFGS method for large scale optimization
- On the use of iterative methods in cubic regularization for unconstrained optimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Relatively smooth convex optimization by first-order methods, and applications
- Strong local convergence properties of adaptive regularized methods for nonlinear least squares
- The Limited Memory Conjugate Gradient Method
- The conjugate gradient method in extremal problems
- Two-Point Step Size Gradient Methods
- Updating the regularization parameter in the adaptive cubic regularization algorithm
Cited in
(3)
This page was built for publication: Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2098802)
