Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
From MaRDI portal
Publication:1904957
DOI10.1007/BF02193464zbMath0838.90095MaRDI QIDQ1904957
Publication date: 30 May 1996
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
unconstrained minimizationNewton-type methodsrow-action methodsconvex quadratic programsconvex quadratic splinelinearly convergent descent methodsmatrix-splitting methods
Related Items
Error bounds for inconsistent linear inequalities and programs ⋮ A dual approach to constrained interpolation from a convex subset of Hilbert space ⋮ A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines ⋮ Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence properties of Hildreth's quadratic programming algorithm
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- Solution of symmetric linear complementarity problems by iterative methods
- Gauss-Seidel method for least-distance problems
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- A Newton Method for Convex Regression, Data Smoothing, and Quadratic Programming with Bounded Constraints
- Convergence of the cyclical relaxation method for linear inequalities
- A differentiable exact penalty function for bound constrained quadratic programming problems
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Some continuity properties of polyhedral multifunctions
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
- Exact Penalty Functions in Constrained Optimization
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- On the Solution of Singular and Semidefinite Linear Systems by Iteration
- Convex programming in Hilbert space
- Convergence Conditions for Ascent Methods
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
