Pages that link to "Item:Q1265874"
From MaRDI portal
The following pages link to A block active set algorithm for large-scale quadratic programming with box constraints (Q1265874):
Displaying 15 items.
- Optimal iterative QP and QPQC algorithms (Q338894) (← links)
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- Computing upper and lower bounds in interval decision trees (Q877064) (← links)
- Convex programming with single separable constraint and bounded variables (Q885824) (← links)
- Merging of Bézier curves with box constraints (Q898952) (← links)
- A class of methods for solving large, convex quadratic programs subject to box constraints (Q1177230) (← links)
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem (Q1734301) (← links)
- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs (Q1737602) (← links)
- Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
- A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix (Q2059678) (← links)
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming (Q2156911) (← links)
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints (Q4389186) (← links)
- Data-driven decision model based on local two-stage weighted ensemble learning (Q6170946) (← links)
