The following pages link to Richard W. Cottle (Q344959):
Displayed 50 items.
- Item:Q344959 (redirect page) (← links)
- Item:Q188526 (redirect page) (← links)
- Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960) (← links)
- A brief history of the international symposia on mathematical programming (Q607500) (← links)
- The principal pivoting method revisited (Q753692) (← links)
- Definiteness and semidefiniteness of quadratic forms revisited (Q799766) (← links)
- A simultaneous projections method for linear inequalities (Q801637) (← links)
- A note on triangulating the 5-cube (Q802144) (← links)
- Estimating ordered parameters by linear programming (Q928896) (← links)
- A field guide to the matrix classes found in the literature of the linear complementarity problem (Q967242) (← links)
- Closed-form solution of a maximization problem (Q1016077) (← links)
- New characterizations of row sufficient matrices (Q1020925) (← links)
- On tridiagonal linear complementarity problems (Q1095609) (← links)
- Six generalized Schur complements (Q1105659) (← links)
- A new continuation method for complementarity problems with uniform P- functions (Q1121180) (← links)
- Scalings of matrices which have prespecified row sums and column sums via optimization (Q1123947) (← links)
- Generalized scalings satisfying linear equations (Q1123948) (← links)
- Observations on a class of nasty linear complementarity problems (Q1141086) (← links)
- On spherically convex sets and \(Q\)-matrices (Q1160080) (← links)
- Minimal triangulation of the 4-cube (Q1163235) (← links)
- On the solution of large, structured linear complementarity problems: The tridiagonal case (Q1245772) (← links)
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem (Q1250029) (← links)
- On the solution of large, structured linear complementarity problems: the block partitioned case (Q1251591) (← links)
- Quartic barriers (Q1294808) (← links)
- Pseudo-monotone complementarity problems in Hilbert space (Q1321257) (← links)
- On ``pre-historic'' linear programming and the figure of the Earth (Q1682983) (← links)
- Manifestations of the Schur complement (Q1845038) (← links)
- A note of Lipschitz constants for solutions of linear inequalities and equations (Q1923226) (← links)
- William Karush and the KKT theorem (Q1946026) (← links)
- Linear and nonlinear optimization (Q2012379) (← links)
- Sufficient matrices belong to \(L\). (Q2490342) (← links)
- Symmetric dual nonlinear programs (Q2521469) (← links)
- Complementary pivot theory of mathematical programming (Q2527120) (← links)
- On classes of copositive matrices (Q2539434) (← links)
- Matrix-theoretic criteria for the quasi-convexity and pseudo-convexity of quadratic functions (Q2553905) (← links)
- George B. Dantzig: a legendary life in mathematical programming (Q2583150) (← links)
- A note onQ-matrices (Q3206682) (← links)
- (Q3321844) (← links)
- The Linear Complementarity Problem (Q3393935) (← links)
- On the uniqueness of solutions to linear complementarity problems (Q3664848) (← links)
- A lagrangean relaxation algorithm for the constrained matrix problem (Q3734170) (← links)
- A constructive characterization ofQ o-matrices with nonnegative principal minors (Q3755249) (← links)
- (Q3858054) (← links)
- (Q3870685) (← links)
- (Q3874444) (← links)
- Completely- matrices (Q3885548) (← links)
- (Q3888873) (← links)
- (Q3899658) (← links)
- Least-index resolution of degeneracy in quadratic programming (Q3902831) (← links)
- (Q3908771) (← links)
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problems (Q3936520) (← links)