A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
type: Item
instance of: scholarly article
title: A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
zbMATH Open document ID: 0851.90088
DOI: 10.1007/BF02592329
author: Wu Li
published in: Mathematical Programming. Series A. Series B
publication date: 1996-07-28T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 910020
zbMATH Keywords: piecewise linear equations
zbMATH Keywords: finite convergence
zbMATH Keywords: global error estimates
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: unconstrained minimization
zbMATH Keywords: strictly convex quadratic spline
MaRDI profile type: Publication
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: Q4765946
cites work: An O(n) algorithm for quadratic knapsack problems
cites work: Quasi-Newton Updates with Bounds
cites work: Q4003375
cites work: The solution of a quadratic programming problem using fast methods to solve systems of linear equations
cites work: Function minimization by conjugate gradients
cites work: On the Maximization of a Concave Quadratic Function with Box Constraints
cites work: Q3348711
cites work: Q5202847
cites work: Q4209438
cites work: Efficient generalized conjugate gradient algorithms. II: Implementation
cites work: Global convergence result for conjugate gradient methods
cites work: Error Bounds for Piecewise Convex Quadratic Programs and Applications
cites work: Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
cites work: Gauss-Seidel method for least-distance problems
cites work: A Newton Method for Convex Regression, Data Smoothing, and Quadratic Programming with Bounded Constraints
cites work: A New Algorithm for Solving Strictly Convex Quadratic Programs
cites work: Iterative Methods for Large Convex Quadratic Programs: A Survey
cites work: On the Solution of Large Quadratic Programming Problems with Bound Constraints
cites work: A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: Some convergence properties of the conjugate gradient method
cites work: Restart procedures for the conjugate gradient method
cites work: A class of methods for solving large, convex quadratic programs subject to box constraints
description: scientific article; zbMATH DE number 910020