Pages that link to "Item:Q3337227"
From MaRDI portal
The following pages link to A weighted gram-schmidt method for convex quadratic programming (Q3337227):
Displaying 8 items.
- Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming (Q706949) (← links)
- A practical factorization of a Schur complement for PDE-constrained distributed optimal control (Q898498) (← links)
- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs (Q1737602) (← links)
- A range-space implementation for large quadratic programs with small active sets (Q2277143) (← links)
- A delayed weighted gradient method for strictly convex quadratic minimization (Q2282816) (← links)
- Methods for convex and general quadratic programming (Q2356335) (← links)
- A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489) (← links)