Concepedia
Mathematical Programming · 1976 · 120 citations · 13 references
Mathematical ProgrammingEngineeringLinear Complementarity ProblemsComplementarity ProblemsDiscrete MathematicsLinear ProgrammingCombinatorial OptimizationComplementarity ProblemComplementarity Theory
13
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
L.M. Bregman · USSR Computational Mathematics and Mathematical Physics · 1967 · 2.6K citations
Mathematical Programming, Common Point, Engineering +10
On matrices with non-positive off-diagonal elements and positive principal minors
Miroslav Fiedler, Vlastimil Pták · Czechoslovak Mathematical Journal · 1962 · 809 citations · Full text
Matrix Factorization, Positive Principal Minors, Matrix Theory +2
Complementary pivot theory of mathematical programming
Richard W. Cottle, George B. Dantzig · Linear Algebra and its Applications · 1968 · 746 citations
Mathematical Programming, Engineering, Computational Complexity +6
The Relaxation Method for Linear Inequalities
T. S. Motzkin, I. J. Schoenberg · Canadian Journal of Mathematics · 1954 · 463 citations · Full text
Mathematical Programming, Numerical Analysis, Engineering +7
The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
Colin W. Cryer · SIAM Journal on Control · 1971 · 436 citations
Mathematical Programming, Numerical Analysis, Engineering +17