Jonathan Eckstein
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jonathan Eckstein has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Avigdor Gal
Department of Management Science and Information Systems Rutgers University 08854 Piscataway NJ USA
1 shared publication - Mikhail Nediak
Smith School of Business, Queen’s University, Kingston, Canada
1 shared publication - Paulo J. S. Silva
Instituto de Matemática, Estatística e Computação Científica (IMECC), Universidade Estadual de Campinas (UNICAMP), Campinas, Brazil
1 shared publication
Latest Publications
- 1 January 2013
- Published by Springer Nature
- p. 1103-1107
Parallel Computing
- 18 October 2005
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 33 (2-3) , 115-156
Double-Regularization Proximal Methods, with Complementarity Applications
- 18 October 2005
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 33 (2-3) , 115-156
Double-Regularization Proximal Methods, with Complementarity Applications
- 1 October 2005
- Published by Springer Nature in Annals of Operations Research
- Vol. 139 (1) , 95-129
Depth-Optimized Convexity Cuts
- 1 October 2005
- Published by Springer Nature in Annals of Operations Research
- Vol. 139 (1) , 95-129
Depth-Optimized Convexity Cuts
- 1 April 2003
- Published by Springer Nature in Mathematical Programming
- Vol. 96 (1) , 61-86
A practical general approximation criterion for methods of multipliers based on Bregman distances
- 1 April 2003
- Published by Springer Nature in Mathematical Programming
- Vol. 96 (1) , 61-86
A practical general approximation criterion for methods of multipliers based on Bregman distances
- Open Access
Managing Periodically Updated Data in Relational Databases: A Stochastic Modeling Approach
Recent trends in information management involve the periodic transcription of data onto secondary devices in a networked environment, and the proper scheduling of these transcriptions is critical for efficient data management. To assist in the scheduling process, we are interested in modeling the reduction of consistency over time between a relation and its replica, termed obsolescence of data. The modeling is based on techniques from the field of stochastic processes, and provides several stochastic models for content evolution in the base relations of a database, taking referential integrity constraints into account. These models are general enough to accommodate most of the common scenarios in databases, including batch insertions and life spans both with and without memory. As an initial "proof of concept" of the applicability of our approach, we validate the insertion portion of our model framework via experiments with real data feeds. We also discuss a set of transcription protocols which make use of the proposed stochastic model.
Open AccessManaging Periodically Updated Data in Relational Databases: A Stochastic Modeling Approach
Recent trends in information management involve the periodic transcription of data onto secondary devices in a networked environment, and the proper scheduling of these transcriptions is critical for efficient data management. To assist in the scheduling process, we are interested in modeling the reduction of consistency over time between a relation and its replica, termed obsolescence of data. The modeling is based on techniques from the field of stochastic processes, and provides several stochastic models for content evolution in the base relations of a database, taking referential integrity constraints into account. These models are general enough to accommodate most of the common scenarios in databases, including batch insertions and life spans both with and without memory. As an initial "proof of concept" of the applicability of our approach, we validate the insertion portion of our model framework via experiments with real data feeds. We also discuss a set of transcription protocols which make use of the proposed stochastic model.
- 1 January 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 83 (1-3) , 113-123
Approximate iterations in Bregman-function-based proximal algorithms
- 1 January 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 83 (1-3) , 113-123
Approximate iterations in Bregman-function-based proximal algorithms