Pages that link to "Item:Q1904957"

The following pages link to Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957):

Displaying 8 items.

• An unconstrained dual program for computing convex \(C^ 1\)-spline approximants (Q1096312) (← links)
• Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
• A dual approach to constrained interpolation from a convex subset of Hilbert space (Q1369249) (← links)
• A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
• Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods (Q2330648) (← 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)