AAAAAA

   
Results: 1-10 |
Results: 10
Maximum-entropy remote sampling
Authors: Anstreicher, KM Fampa, M Lee, J Williams, J
Citation: Km. Anstreicher et al., Maximum-entropy remote sampling, DISCR APP M, 108(3), 2001, pp. 211-226
A new bound for the quadratic assignment problem based on convex quadraticprogramming
Authors: Anstreicher, KM Brixius, NW
Citation: Km. Anstreicher et Nw. Brixius, A new bound for the quadratic assignment problem based on convex quadraticprogramming, MATH PROGR, 89(3), 2001, pp. 341-357
A note on the augmented Hessian when the reduced Hessian is semidefinite
Authors: Anstreicher, KM Wright, MH
Citation: Km. Anstreicher et Mh. Wright, A note on the augmented Hessian when the reduced Hessian is semidefinite, SIAM J OPTI, 11(1), 2000, pp. 243-253
Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem
Authors: Anstreicher, KM
Citation: Km. Anstreicher, Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem, SIAM J OPTI, 11(1), 2000, pp. 254-265
The volumetric barrier for semidefinite programming
Authors: Anstreicher, KM
Citation: Km. Anstreicher, The volumetric barrier for semidefinite programming, MATH OPER R, 25(3), 2000, pp. 365-380
Linear programming in O(n(3)/ln n/L) operations
Authors: Anstreicher, KM
Citation: Km. Anstreicher, Linear programming in O(n(3)/ln n/L) operations, SIAM J OPTI, 9(4), 1999, pp. 803-812
Probabilistic analysis of an infeasible-interior-point algorithm for linear programming
Authors: Anstreicher, KM Ji, J Potra, FA Ye, YY
Citation: Km. Anstreicher et al., Probabilistic analysis of an infeasible-interior-point algorithm for linear programming, MATH OPER R, 24(1), 1999, pp. 176-192
Ellipsoidal approximations of convex sets based on the volumetric barrier
Authors: Anstreicher, KM
Citation: Km. Anstreicher, Ellipsoidal approximations of convex sets based on the volumetric barrier, MATH OPER R, 24(1), 1999, pp. 193-203
Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
Authors: Anstreicher, KM Fampa, M Lee, J Williams, J
Citation: Km. Anstreicher et al., Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems, MATH PROGR, 85(2), 1999, pp. 221-240
Towards a practical volumetric cutting plane method for convex programming
Authors: Anstreicher, KM
Citation: Km. Anstreicher, Towards a practical volumetric cutting plane method for convex programming, SIAM J OPTI, 9(1), 1998, pp. 190-206
Risultati: 1-10 |