The following pages link to Hannu Väliaho (Q796004):
Displaying 32 items.
- (Q677142) (redirect page) (← links)
- Determining the handicap of a sufficient matrix (Q677143) (← links)
- On the Hermite interpolation polynomial (Q796005) (← links)
- A polynomial-time test for M-matrices (Q805154) (← links)
- A note on locating eigenvalues (Q1075020) (← links)
- Criteria for copositive matrices (Q1079631) (← links)
- Testing the definiteness of matrices on polyhedral cones (Q1104045) (← links)
- Determining the inertia of a matrix pencil as a function of the parameter (Q1104379) (← links)
- Almost copositive matrices (Q1120638) (← links)
- On the definity of quadratic forms subject to linear constraints (Q1168219) (← links)
- Almost definiteness of matrices on polyhedral cones (Q1183149) (← links)
- Determining subspaces on which a matrix is nonnegative definite (Q1189625) (← links)
- Cycling can occur in Mráz's algorithm for nonconvex quadratic programming (Q1310620) (← links)
- Quadratic-programming criteria for copositive matrices (Q1823293) (← links)
- Criteria for sufficient matrices (Q1906774) (← links)
- \(P_ *\)-matrices are just sufficient (Q1913648) (← links)
- The Boolean pivot operation, \(M\)-matrices, and reducible matrices (Q2365720) (← links)
- A unified approach to one-parametric general quadratic programming (Q3703660) (← links)
- Note on pencils of matrices (Q3818898) (← links)
- (Q3926364) (← links)
- (Q4101329) (← links)
- A procedure for one-parametric linear programming (Q4196261) (← links)
- A new proof for the criss-cross method for quadratic programming (Q4327956) (← links)
- An Elementary Approach to the Jordan Form of a Matrix (Q4726393) (← links)
- A procedure for the one-parametric linear complementarity problem (Q4764898) (← links)
- (Q5572800) (← links)
- (Q5590538) (← links)
- (Q5623136) (← links)
- (Q5630844) (← links)
- (Q5630845) (← links)
- (Q5655181) (← links)
- A procedure for parameterizing a constraint in linear programming (Q5685854) (← links)