Conjugate gradient algorithms in nonconvex optimization
smoothconjugate gradientglobal convergencenonsmoothlocal convergencerestartlimited memorysubgradient algorithmmethodpreconditionedbox constrainedreduced Hessianmemorylessshortest residual
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Methods of quasi-Newton type (90C53) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)
- Exploiting damped techniques for nonlinear conjugate gradient methods
- Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- MINRES: from negative curvature detection to monotonicity properties
- scientific article; zbMATH DE number 992801 (Why is no real title available?)
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
- scientific article; zbMATH DE number 1889337 (Why is no real title available?)
- Nonlinear conjugate gradient for smooth convex functions
- A new class of nonlinear conjugate gradient method for unconstrained optimization models and its application in portfolio selection
- Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation
- A globally convergent hybrid conjugate gradient method and its numerical behaviors
- Decision-control mechanism for Markovian jump linear systems with Gaussian noise
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- A new family of conjugate gradient methods for unconstrained optimization
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- A link between the steepest descent method and fixed-point iterations
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Gradient-based solution algorithms for a class of bilevel optimization and optimal control problems with a nonsmooth lower level
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- A new class of nonlinear conjugate gradient coefficients with global convergence properties
- Energy minimization and preconditioning in the simulation of athermal granular materials in two dimensions
- Reconstruction of sparse-view tomography via preconditioned Radon sensing matrix
- CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method
- Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
This page was built for publication: Conjugate gradient algorithms in nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947710)
