A Subspace Study on Conjugate Gradient Algorithms

From MaRDI portal
Revision as of 02:32, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4835475

DOI10.1002/zamm.19950750118zbMath0823.65061OpenAlexW2036795720MaRDI QIDQ4835475

Josef Stoer, Ya-Xiang Yuan

Publication date: 25 June 1995

Published in: ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/zamm.19950750118




Related Items (34)

A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimizationNew hybrid conjugate gradient method for unconstrained optimizationSubspace methods for large scale nonlinear equations and nonlinear least squaresA new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimizationNew hybrid conjugate gradient method as a convex combination of LS and FR methodsA three-term derivative-free projection method for nonlinear monotone system of equationsA Barzilai-Borwein conjugate gradient methodOn efficiently combining limited-memory and trust-region techniquesA globally convergent Newton-GMRES method for large sparse systems of nonlinear equationsAnother conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimizationA new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimizationA subspace conjugate gradient algorithm for large-scale unconstrained optimizationAn optimal subgradient algorithm with subspace search for costly convex optimization problemsUnnamed ItemA three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression modelA regularized limited memory subspace minimization conjugate gradient method for unconstrained optimizationA new subspace minimization conjugate gradient method for unconstrained minimizationAn overview of nonlinear optimizationA new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimizationAn accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimizationAn efficient Barzilai-Borwein conjugate gradient method for unconstrained optimizationA class of accelerated subspace minimization conjugate gradient methodsAn adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy conditionA family of quasi-Newton methods for unconstrained optimization problemsA Riemannian subspace limited-memory SR1 trust region methodSubspace Methods in Multi-Parameter Seismic Full Waveform InversionA subspace implementation of quasi-Newton trust region methods for unconstrained optimizationAcceleration of sequential subspace optimization in Banach spaces by orthogonal search directionsAn accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimizationNew subspace minimization conjugate gradient methods based on regularization model for unconstrained optimizationA subspace minimization conjugate gradient method based on conic model for unconstrained optimizationA new conjugate gradient method with an efficient memory structureA subspace SQP method for equality constrained optimizationSeveral accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems


Uses Software



Cites Work




This page was built for publication: A Subspace Study on Conjugate Gradient Algorithms