Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-8
|
Results: 8
Incremental subgradient methods for nondifferentiable optimization
Authors:
Nedic, A Bertsekas, DP
Citation:
A. Nedic et Dp. Bertsekas, Incremental subgradient methods for nondifferentiable optimization, SIAM J OPTI, 12(1), 2001, pp. 109-138
Distributed power control algorithms for wireless networks
Authors:
Wu, C Bertsekas, DP
Citation:
C. Wu et Dp. Bertsekas, Distributed power control algorithms for wireless networks, IEEE VEH T, 50(2), 2001, pp. 504-514
Missile defense and interceptor allocation by neuro-dynamic programming
Authors:
Bertsekas, DP Homer, ML Logan, DA Patek, SD Sandell, NR
Citation:
Dp. Bertsekas et al., Missile defense and interceptor allocation by neuro-dynamic programming, IEEE SYST A, 30(1), 2000, pp. 42-51
Gradient convergence in gradient methods with errors
Authors:
Bertsekas, DP Tsitsiklis, JN
Citation:
Dp. Bertsekas et Jn. Tsitsiklis, Gradient convergence in gradient methods with errors, SIAM J OPTI, 10(3), 2000, pp. 627-642
An epsilon-relaxation method for separable convex cost generalized networkflow problems
Authors:
Tseng, P Bertsekas, DP
Citation:
P. Tseng et Dp. Bertsekas, An epsilon-relaxation method for separable convex cost generalized networkflow problems, MATH PROGR, 88(1), 2000, pp. 85-104
Rollout algorithms for stochastic scheduling problems
Authors:
Bertsekas, DP Castanon, DA
Citation:
Dp. Bertsekas et Da. Castanon, Rollout algorithms for stochastic scheduling problems, J HEURISTIC, 5(1), 1999, pp. 89-108
A note on error bounds for convex and nonconvex programs
Authors:
Bertsekas, DP
Citation:
Dp. Bertsekas, A note on error bounds for convex and nonconvex programs, COMPUT OP A, 12(1-3), 1999, pp. 41-51
Stochastic shortest path games
Authors:
Patek, SD Bertsekas, DP
Citation:
Sd. Patek et Dp. Bertsekas, Stochastic shortest path games, SIAM J CON, 37(3), 1999, pp. 804-824
Risultati:
1-8
|