Conjugate Gradient Methods with Inexact Searches
From MaRDI portal
Publication:4184635
DOI10.1287/moor.3.3.244zbMath0399.90077OpenAlexW2122565324MaRDI QIDQ4184635
Publication date: 1978
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.3.3.244
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)
Related Items
New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters, Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method, An adaptive modified three-term conjugate gradient method with global convergence, Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization, A restart scheme for the memoryless BFGS method, A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery, A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function, A new nonmonotone line search technique for unconstrained optimization, HARES: An efficient method for first-principles electronic structure calculations of complex systems, Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization, Some descent three-term conjugate gradient methods and their global convergence, Two hybrid nonlinear conjugate gradient methods based on a modified secant equation, A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications, Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update, A hybrid approach for finding approximate solutions to constrained nonlinear monotone operator equations with applications, Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization, Globally convergent conjugate gradient algorithms, Modelling the otolith membrane using boundary-fitted coordinates, A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization, A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection, On Variable-Metric Methods for Sparse Hessians, A scaled three-term conjugate gradient method for unconstrained optimization, A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method, A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems, An adaptive direct variational grid generation method, A new family of globally convergent conjugate gradient methods, Optimal control of a class of piecewise deterministic processes, A globally convergent version of the Polak-Ribière conjugate gradient method, Convergence of the Polak-Ribiére-Polyak conjugate gradient method, A gradient-related algorithm with inexact line searches, Inverse determination of a heat source from natural convection in a porous cavity, New three-term conjugate gradient method with guaranteed global convergence, A conjugate gradient sampling method for nonsmooth optimization, A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization, Symmetric Perry conjugate gradient method, Globally convergence of nonlinear conjugate gradient method for unconstrained optimization, Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization, A double parameter scaled BFGS method for unconstrained optimization, The method of successive affine reduction for nonlinear minimization, Two modified scaled nonlinear conjugate gradient methods, A modified conjugate gradient method based on the self-scaling memoryless BFGS update, New conjugate gradient method for unconstrained optimization, New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method, A double parameter self-scaling memoryless BFGS method for unconstrained optimization, Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization, Computational experience with conjugate gradient algorithms, Global convergence of a modified Fletcher–Reeves conjugate gradient method with Wolfe line search, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., A scaled nonlinear conjugate gradient algorithm for unconstrained optimization, A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula, On the sufficient descent property of the Shanno's conjugate gradient method, Some computational advances in unconstrained optimization, Some numerical experiments with variable-storage quasi-Newton algorithms, On the limited memory BFGS method for large scale optimization, Accelerated solution techniques and concrete cracking, A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization, A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei, Minimization of extended quadratic functions, Conjugate gradient methods using quasi-Newton updates with inexact line searches, A three-parameter family of nonlinear conjugate gradient methods, Unnamed Item, A three‐dimensional numerical internal tidal model involving adjoint method, A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method, A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization, Cubic regularization in symmetric rank-1 quasi-Newton methods, Some remarks on conjugate gradient methods without line search, Tracing post-limit-point paths with incomplete or without factorization of the stiffness matrix, Relaxation of crystals with the quasi-Newton method, An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods, Multi-step nonlinear conjugate gradient methods for unconstrained minimization, Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods, A numerical method for an approximate minimax estimator in linear regression, Scaled conjugate gradient algorithms for unconstrained optimization, An adaptive competitive penalty method for nonsmooth constrained optimization, Some numerical methods for the study of the convexity notions arising in the calculus of variations, A practical method for solving large-scale TRS, Formulation and numerical solution of finite-level quantum optimal control problems, Applying powell's symmetrical technique to conjugate gradient methods, Application of scaled nonlinear conjugate-gradient algorithms to the inverse natural convection problem, Modeling and control through leadership of a refined flocking system, Two new conjugate gradient methods based on modified secant equations, Some nonlinear conjugate gradient methods based on spectral scaling secant equations, Accelerated scaled memoryless 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, Scaled memoryless symmetric rank one method for large-scale optimization, Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization, Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions, An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization, Some sufficient descent conjugate gradient methods and their global convergence, A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems, CALIBRATION OF LÉVY PROCESSES USING OPTIMAL CONTROL OF KOLMOGOROV EQUATIONS WITH PERIODIC BOUNDARY CONDITIONS, A new CG algorithm based on a scaled memoryless BFGS update with adaptive search strategy, and its application to large-scale unconstrained optimization problems, Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function, A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications, The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems, A conjugate gradient method with sufficient descent property, Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization, Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications, Vectorization of conjugate-gradient methods for large-scale minimization in meteorology, A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method, Scaled nonlinear conjugate gradient methods for nonlinear least squares problems, A new two-parameter family of nonlinear conjugate gradient methods, The application of optimal control methodology to nonlinear programming problems, QN-like variable storage conjugate gradients, Planar quasi-Newton algorithms for unconstrained saddlepoint problems, A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method, Conjugate direction methods with variable storage, On diagonally-preconditioning the 2-step BFGS method with accumulated steps for linearly constrained nonlinear programming, The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems, Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations, Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization, A fast and robust unconstrained optimization method requiring minimum storage
