| 2007 |
|---|
| 11 | EE | Marc Teboulle:
A Unified Continuous Optimization Framework for Center-Based Clustering Methods.
Journal of Machine Learning Research 8: 65-102 (2007) |
| 2005 |
|---|
| 10 | EE | Jacob Kogan,
Marc Teboulle,
Charles K. Nicholas:
Data Driven Similarity Measures for k-Means Like Clustering Algorithms.
Inf. Retr. 8(2): 331-349 (2005) |
| 9 | EE | Alfred Auslender,
Marc Teboulle:
Interior projection-like methods for monotone variational inequalities.
Math. Program. 104(1): 39-68 (2005) |
| 2004 |
|---|
| 8 | EE | Alfred Auslender,
Marc Teboulle:
Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization.
Math. Oper. Res. 29(1): 1-26 (2004) |
| 2003 |
|---|
| 7 | EE | Amir Beck,
Marc Teboulle:
Mirror descent and nonlinear projected subgradient methods for convex optimization.
Oper. Res. Lett. 31(3): 167-175 (2003) |
| 2000 |
|---|
| 6 | EE | Amir Beck,
Marc Teboulle:
A probabilistic result for the max-cut problem on random graphs.
Oper. Res. Lett. 27(5): 209-214 (2000) |
| 1996 |
|---|
| 5 | | Aharon Ben-Tal,
Marc Teboulle:
Hidden convexity in some nonconvex quadratically constrained quadratic programming.
Math. Program. 72: 51-63 (1996) |
| 4 | | Roman A. Polyak,
Marc Teboulle:
Nonlinear rescaling and proximal-like methods in convex optimization.
Math. Program. 76: 265-284 (1996) |
| 1994 |
|---|
| 3 | | Gong Chen,
Marc Teboulle:
A proximal-based decomposition method for convex minimization problems.
Math. Program. 64: 81-101 (1994) |
| 1993 |
|---|
| 2 | | Marc Teboulle,
Igor Vajda:
Convergence of best phi-entropy estimates.
IEEE Transactions on Information Theory 39(1): 297- (1993) |
| 1986 |
|---|
| 1 | | Aharon Ben-Tal,
Marc Teboulle:
Rate distortion theory with generalized information measures via convex programming duality.
IEEE Transactions on Information Theory 32(5): 630-641 (1986) |
