Pages that link to "Item:Q4317664"

The following pages link to A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables (Q4317664):

Displaying 14 items.

• Penalized splines for smooth representation of high-dimensional Monte Carlo datasets (Q313059) (← links)
• The non-parametric sub-pixel local point spread function estimation is a well posed problem (Q409155) (← links)
• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix (Q781116) (← links)
• A comparison of solvers for linear complementarity problems arising from large-scale masonry structures. (Q954579) (← links)
• Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available (Q1785410) (← links)
• A hybrid algorithm for the solution of a single commodity spatial equilibrium model (Q1919772) (← links)
• A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix (Q2059678) (← links)
• A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization (Q2340521) (← links)
• Estimation of positive definite \(M\)-matrices and structure learning for attractive Gaussian Markov random fields (Q2341885) (← links)
• On the incomplete oblique projections method for solving box constrained least squares problems (Q2453469) (← links)
• Novel Algorithm for Non-Negative Matrix Factorization (Q4598034) (← links)
• A regularized interior-point method for constrained linear least squares (Q5882390) (← links)
• Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares (Q6097120) (← links)
• An index search method based inner-outer iterative algorithm for solving nonnegative least squares problems (Q6098939) (← links)