A nonmonotone conjugate gradient algorithm for unconstrained optimization
From MaRDI portal
Publication:698402
zbMATH Open1019.90039MaRDI QIDQ698402FDOQ698402
Publication date: 16 January 2003
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Cited In (45)
- Title not available (Why is that?)
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- Convergence of the nonmonotone Perry and Shanno method for optimization
- A conjugate gradient method with descent direction for unconstrained optimization
- Another modified version of RMIL conjugate gradient method
- A modified nonlinear conjugate gradient method with the Armijo line search and its application
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A modified PRP conjugate gradient method
- On the convergence rate of scaled gradient projection method
- Proximal quasi-Newton method for composite optimization over the Stiefel manifold
- Two modified Dai-Yuan nonlinear conjugate gradient methods
- Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
- Riemannian optimization methods for the truncated Takagi factorization
- Accelerated nonmonotone line search technique for multiobjective optimization
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- A conjugate gradient method for unconstrained optimization problems
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- A nonmonotonic hybrid algorithm for min-max problem
- AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL
- New line search methods for unconstrained optimization
- A non-monotone line search algorithm for unconstrained optimization
- An efficient algorithm for solving a class of matrix optimization problem in scalable probabilistic approximation
- An adaptive regularized proximal Newton-type methods for composite optimization over the Stiefel manifold
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- An overview of nonlinear optimization
- Nonmonotone alternative direction method based on simple conic model for unconstrained optimization
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- A Riemannian optimization approach for solving the generalized eigenvalue problem for nonsquare matrix pencils
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- Transportless conjugate gradient for optimization on Stiefel manifold
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- A Riemannian conjugate gradient approach for solving the generalized eigenvalue problem with minimal perturbation
- A survey of gradient methods for solving nonlinear optimization
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- A monotone gradient method via weak secant equation for unconstrained optimization
- A modified three-term PRP conjugate gradient algorithm for optimization models
Recommendations
- Another nonlinear conjugate gradient algorithm for unconstrained optimization π π
- A NEW NONLINEAR CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION π π
- A class of nonmonotone conjugate gradient methods for unconstrained optimization π π
- Nonlinear conjugate gradient methods for unconstrained optimization π π
- A nonmonotone hybrid conjugate gradient method for unconstrained optimization π π
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: A nonmonotone conjugate gradient algorithm for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698402)