ON THE CLASSICAL LOGARITHMIC BARRIER FUNCTION METHOD FOR A CLASS OF SMOOTH CONVEX PROGRAMMING PROBLEMS
Similar Items:
National Aeronautics and Space Adminstration |
7
Technical Paper
A POTENTIAL REDUCTION VARIANT OF RENEGAR'S SHORT-STEP PATH-FOLLOWING METHOD FOR LINEAR PROGRAMMING
National Aeronautics and Space Adminstration |
National Aeronautics and Space Adminstration |
8
Technical Paper
AN 0(ゎjCOMPLEXITY REDUCTION FOR THE LONG-STEP PATH-FOLLOWING ALGORITHM FOR LINEAR PROGRAMMING
National Aeronautics and Space Adminstration |
National Aeronautics and Space Adminstration |
9
Conference Proceedings
The Linear Complementarity Problem, Sufficient Matrices and the Criss-Cross Method
Springer-Verlag |
National Aeronautics and Space Adminstration |
10
Technical Paper
THE THEORY OF LINEAR PROGRAMMING: SKEW SYMMETRIC SELF-DUAL PROBLEMS AND THE CENTRAL PATH
National Aeronautics and Space Adminstration |
National Aeronautics and Space Adminstration |
11
Technical Paper
PRIMAL-DUAL ALGOTITHMS FOR LINEAR PROGRAMMING BASED ON THE LOGARITHEMIC BARRIR METHOD
National Aeronautics and Space Adminstration |
National Aeronautics and Space Adminstration |
National Aeronautics and Space Adminstration |