AAAAAA
Results:
1-9
|
Results: 9
Authors:
Tuncel, L
Xu, S
Citation: L. Tuncel et S. Xu, On homogeneous convex cones, the caratheodory number, and the duality mapping, MATH OPER R, 26(2), 2001, pp. 234-247
Authors:
Todd, MJ
Tuncel, L
Ye, YY
Citation: Mj. Todd et al., Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems, MATH PROGR, 90(1), 2001, pp. 59-69
Authors:
Pataki, G
Tuncel, L
Citation: G. Pataki et L. Tuncel, On the generic properties of convex optimization problems in conic form, MATH PROGR, 89(3), 2001, pp. 449-457
Authors:
Kojima, M
Tuncel, L
Citation: M. Kojima et L. Tuncel, Cones of matrices and successive convex relaxations of nonconvex sets, SIAM J OPTI, 10(3), 2000, pp. 750-778
Authors:
Kojima, M
Tuncel, L
Citation: M. Kojima et L. Tuncel, Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization, MATH PROGR, 89(1), 2000, pp. 79-111
Authors:
Stephen, T
Tuncel, L
Citation: T. Stephen et L. Tuncel, On a representation of the matching polytope via semidefinite liftings, MATH OPER R, 24(1), 1999, pp. 1-7
Authors:
Tuncel, L
Citation: L. Tuncel, On the condition numbers for polyhedra in Kasmarkar's form, OPER RES L, 24(4), 1999, pp. 149-155
Authors:
Tuncel, L
Citation: L. Tuncel, Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard, MATH PROGR, 86(1), 1999, pp. 219-223
Authors:
Tuncel, L
Citation: L. Tuncel, Primal-dual symmetry and scale invariance of interior-point algorithms forconvex optimization, MATH OPER R, 23(3), 1998, pp. 708-718
Risultati:
1-9
|