Pages that link to "Item:Q1919811"

The following pages link to A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811):

Displaying 8 items.

• On a conjugate directions method for solving strictly convex QP problem (Q684136) (← links)
• Regularized gap function as penalty term for constrained minimization problems (Q1018314) (← links)
• An unconstrained dual program for computing convex \(C^ 1\)-spline approximants (Q1096312) (← links)
• Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
• Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
• Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions (Q2821800) (← links)
• (Q4379948) (← links)
• The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches (Q5948829) (← links)