Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Convergence Conditions for Ascent Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curvilinear path steplength algorithms for minimization which use directions of negative curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gauss-Seidel method for least-distance problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton Method for Convex Regression, Data Smoothing, and Quadratic Programming with Bounded Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Solving Strictly Convex Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3909906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Singular and Semidefinite Linear Systems by Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Methods for Large Convex Quadratic Programs: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the cyclical relaxation method for linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of symmetric linear complementarity problems by iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: More results on the convergence of iterative methods for the symmetric linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuity properties of polyhedral multifunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Piecewise Convex Quadratic Programs and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Penalty Functions in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A differentiable exact penalty function for bound constrained quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence properties of Hildreth's quadratic programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Hildreth’s Row-Action Method for Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming in Hilbert space / rank
 
Normal rank

Latest revision as of 08:12, 24 May 2024

scientific article
Language Label Description Also known as
English
Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
scientific article

    Statements

    Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (English)
    0 references
    0 references
    30 May 1996
    0 references
    linearly convergent descent methods
    0 references
    convex quadratic spline
    0 references
    convex quadratic programs
    0 references
    unconstrained minimization
    0 references
    row-action methods
    0 references
    matrix-splitting methods
    0 references
    Newton-type methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers