AAAAAA
Results:
1-16
|
Results: 16
Authors:
De Klerk, E
Peng, J
Roos, C
Terlaky, T
Citation: E. De Klerk et al., A scaled Gauss-Newton primal-dual search direction for semidefinite optimization, SIAM J OPTI, 11(4), 2001, pp. 870-888
Authors:
van der Lee, PEA
Terlaky, T
Woudstra, T
Citation: Pea. Van Der Lee et al., A new approach to optimizing energy systems, COMPUT METH, 190(40-41), 2001, pp. 5297-5310
Authors:
Peng, J
Roos, C
Terlaky, T
Citation: J. Peng et al., New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction, J OPTIM TH, 109(2), 2001, pp. 327-343
Authors:
Andersen, ED
Mitchell, JE
Roos, C
Terlaky, T
Citation: Ed. Andersen et al., A homogenized cutting plane method to solve the convex feasibility problem, APPL OPTIM, 52, 2001, pp. 167-190
Authors:
Illes, T
Peng, JM
Roos, C
Terlaky, T
Citation: T. Illes et al., A strongly polynomial rounding procedure yielding a maximally complementary solution for P-(k) linear complementarity problems, SIAM J OPTI, 11(2), 2000, pp. 320-340
Authors:
Koltai, T
Terlaky, T
Citation: T. Koltai et T. Terlaky, The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming, INT J PRO E, 65(3), 2000, pp. 257-274
Authors:
Bomze, IM
Dur, M
de Klerk, E
Roos, C
Quist, AJ
Terlaky, T
Citation: Im. Bomze et al., On copositive programming and standard quadratic optimization problems, J GLOB OPT, 18(4), 2000, pp. 301-320
Authors:
Peng, J
Roos, C
Terlaky, T
Citation: J. Peng et al., New complexity analysis of the primal-dual Newton method for linear optimization, ANN OPER R, 99, 2000, pp. 23-39
Authors:
Roos, C
Terlaky, T
Citation: C. Roos et T. Terlaky, Special issue - Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques (HPOPT'96) September 19-20, 1996, Delft, Netherlands - Preface, APPL NUM M, 29(3), 1999, pp. 253-253
Authors:
de Klerk, E
Roos, C
Terlaky, T
Citation: E. De Klerk et al., Primal-dual potential reduction methods for semidefinite programming usingaffine-scaling directions, APPL NUM M, 29(3), 1999, pp. 335-360
Authors:
Luo, ZQ
Roos, C
Terlaky, T
Citation: Zq. Luo et al., Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, APPL NUM M, 29(3), 1999, pp. 379-394
Authors:
Roos, C
Terlaky, T
Citation: C. Roos et T. Terlaky, Note on a paper of Broyden, OPER RES L, 25(4), 1999, pp. 183-186
Authors:
Terlaky, T
Tsuchiya, T
Citation: T. Terlaky et T. Tsuchiya, A note on Mascarenhas' counterexample about global convergence of the affine scaling algorithm, APPL MATH O, 40(3), 1999, pp. 287-314
Authors:
Nemirovski, A
Roos, C
Terlaky, T
Citation: A. Nemirovski et al., On maximization of quadratic form over intersection of ellipsoids with common center, MATH PROGR, 86(3), 1999, pp. 463-473
Authors:
Berkelaar, AB
Jansen, B
Roos, K
Terlaky, T
Citation: Ab. Berkelaar et al., Basis- and partition identification for quadratic programming and linear complementarity problems, MATH PROGR, 86(2), 1999, pp. 261-282
Authors:
Greenberg, HJ
Holder, AG
Roos, K
Terlaky, T
Citation: Hj. Greenberg et al., On the dimension of the set of rim perturbations for optimal partition invariance, SIAM J OPTI, 9(1), 1998, pp. 207-216
Risultati:
1-16
|