Pages that link to "Item:Q1295961"
From MaRDI portal
The following pages link to Bound constrained quadratic programming via piecewise quadratic functions (Q1295961):
Displaying 9 items.
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming (Q706949) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces (Q2370069) (← links)
- Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions (Q2450909) (← links)
- Extension of Eaves theorem for determining the boundedness of convex quadratic programming problems (Q2663382) (← links)
- Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense (Q2672733) (← links)
- Piecewise quadratic approximation of the non-dominated set for bi-criteria programs (Q2720018) (← links)
- A finite newton method for classification (Q4405946) (← links)
- Combined relaxation method for monotone equilibrium problems (Q5956433) (← links)