scientific article; zbMATH DE number 3363347

From MaRDI portal
Revision as of 04:12, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5636694

zbMath0228.90034MaRDI QIDQ5636694

G. Zoutendijk

Publication date: 1970


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (26)

Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problemsSufficient descent conjugate gradient methods for large-scale optimization problemsA family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS methodA NOTE ON THE CONVERGENCE OF THE DFP ALGORITHM ON QUADRATIC UNIFORMLY CONVEX FUNCTIONSUnnamed ItemConstrained optimal control of switched systems based on modified BFGS algorithm and filled function methodNew three-term conjugate gradient method with guaranteed global convergenceA modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functionsSpectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimizationPacking identical spheres into a cylinderAn improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart directionA modified Polak–Ribi‘ere–Polyak descent method for unconstrained optimizationGlobal convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problemsSome descent three-term conjugate gradient methods and their global convergenceHybrid conjugate gradient methods for unconstrained optimizationModified Hestenes-Steifel conjugate gradient coefficient for unconstrained optimizationAn accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimizationAn efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problemOn a dual method for a specially structured linear programming problem with application to stochastic programmingA new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS updateApplying the Powell's Symmetrical Technique to Conjugate Gradient Methods with the Generalized Conjugacy ConditionA new accelerated conjugate gradient method for large-scale unconstrained optimizationA nonlinear conjugate gradient method based on the MBFGS secant conditionDescent Property and Global Convergence of a New Search Direction Method for Unconstrained OptimizationTwo classes of spectral conjugate gradient methods for unconstrained optimizationsA CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION







This page was built for publication: