On a conjugate directions method for solving strictly convex QP problem
type: Item
instance of: scholarly article
title: On a conjugate directions method for solving strictly convex QP problem
zbMATH Open document ID: 1387.90177
author: Andrzej Stachurski
published in: Mathematical Methods of Operations Research
publication date: 2018-02-09T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 65F05
zbMATH DE Number: 6836893
zbMATH Keywords: conjugate directions
zbMATH Keywords: quadratic programming problems
zbMATH Keywords: distributed calculations
Wikidata QID: Q59609456
describes a project that uses: Harwell-Boeing sparse matrix collection
describes a project that uses: SelInv
describes a project that uses: MASTAN
describes a project that uses: CSparse
describes a project that uses: SparseMatrix
describes a project that uses: MatrixMarket
MaRDI profile type: Publication
full work available at URL: s00186-017-0607-z
OpenAlex ID: W2755546414
cites work: Fast inverse Cholesky decomposition for rectangular Toeplitz-block matrix
cites work: Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
cites work: Q4209222
cites work: Q4001523
cites work: An efficient method for finding the minimum of a function of several variables without calculating derivatives
cites work: Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: The university of Florida sparse matrix collection
cites work: A survey of direct methods for sparse linear systems
cites work: Sparse matrix test problems
cites work: A block version of BiCGSTAB for linear systems with multiple right-hand sides
cites work: A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
cites work: A block conjugate gradient method applied to linear systems with multiple right-hand sides
cites work: Q4226179
cites work: Function minimization by conjugate gradients
cites work: On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: Methods of conjugate gradients for solving linear systems
cites work: SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
cites work: Symbiosis between linear algebra and optimization
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: Recent computational developments in Krylov subspace methods for linear systems
cites work: Q5657580
cites work: Q4023802
cites work: Q4342463
cites work: Convergence analysis of an algorithm for accurate inverse Cholesky factorization
DBLP publication ID: journals/mmor/Stachurski17
DOI: 10.1007/S00186-017-0607-Z
description: scientific article; zbMATH DE number 6836893