Pages that link to "Item:Q4229473"
From MaRDI portal
The following pages link to A Finite Continuation Algorithm for Bound Constrained Quadratic Programming (Q4229473):
Displayed 8 items.
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming (Q706949) (← links)
- Computing upper and lower bounds in interval decision trees (Q877064) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss (Q2129205) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces (Q2370069) (← links)
- Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense (Q2672733) (← links)
- A finite newton method for classification (Q4405946) (← links)