On a conjugate directions method for solving strictly convex QP problem

DOI10.1007/s00186-017-0607-zzbMath1387.90177OpenAlexW2755546414WikidataQ59609456 ScholiaQ59609456MaRDI QIDQ684136

Andrzej Stachurski

Publication date: 9 February 2018

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-017-0607-z

zbMATH Keywords

conjugate directionsdistributed calculationsquadratic programming problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Uses Software

• MatrixMarket
• SparseMatrix
• Harwell-Boeing sparse matrix collection
• SelInv
• MASTAN
• CSparse

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
• Symbiosis between linear algebra and optimization
• A block version of BiCGSTAB for linear systems with multiple right-hand sides
• Convergence analysis of an algorithm for accurate inverse Cholesky factorization
• A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
• A block conjugate gradient method applied to linear systems with multiple right-hand sides
• SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
• The university of Florida sparse matrix collection
• Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
• On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
• Recent computational developments in Krylov subspace methods for linear systems
• Sparse matrix test problems
• Fast inverse Cholesky decomposition for rectangular Toeplitz-block matrix
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• The conjugate gradient method in extremal problems
• A survey of direct methods for sparse linear systems
• Methods of conjugate gradients for solving linear systems