Skip to content
DraconiticResearch
Search Sources API
194,164 studies31 sourcesUpdated 16 min ago
PreprintarXiv licencearXiv

Linearly Constrained Generalized Linear Models with Applications in Origin-Destination Estimation

Abstract

We show that data censored by linear constraints can be fit within the generalized linear model (GLM) framework, recovering the expected latent counts together with their uncertainty in a single Fisher-scoring procedure. Our motivating application is origin-destination (OD) estimation in transportation studies, where the latent data are the OD trip demands and constraints are either origin and destination marginal counts per zone, as in OD matrix estimation, or observed link counts, as in network tomography. Casting the problem as a linearly constrained GLM lets us treat, within one model, three features that arise routinely in practice: unmatched constraints, trip predictors such as costs, and prior information such as diagonal dominance and seed counts. We demonstrate the methodology in synthetic and small scale studies and in a larger case study based on simulated data from the BO4Mob study.

Related

  1. A Parallel Adaptive Proximal ADMM for Linearly Constrained Separable Composite Optimization Problems
    Leandro F. Maia, Renato D. C. Monteiro, Gilson N. Silva
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Fast Rates and Strong Convergence of Tikhonov-Regularized Mixed-Order Primal-Dual Dynamics for Linearly Constrained Optimization Without Eventual Ball Conditions
    Hong-lu Li, Yi-bin Xiao
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Cohomology of Linearly Constrained Kloosterman Families: Newton Polytopes, Weights, and Boundary Monodromy
    Hamed Ebadi
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  4. Moments and Large Geometric Monodromy for Linearly Constrained Kloosterman Families
    Hamed Ebadi
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. Efficient ADMM for Soft-Constrained Quadratic Programs via Generalized Slack Projections
    Roland Schwan, Thomas Lew, Brian Plancher
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{chou2026linearly,
  title = {{Linearly Constrained Generalized Linear Models with Applications in Origin-Destination Estimation}},
  author = {Likun Chou and Luis Carvalho},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.09021},
  eprint = {2609.09021},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.09021},
}
RIS
TY  - UNPB
TI  - Linearly Constrained Generalized Linear Models with Applications in Origin-Destination Estimation
AU  - Likun Chou
AU  - Luis Carvalho
PY  - 2026
DA  - 2026/09/08
PB  - arXiv
DO  - 10.48550/arxiv.2609.09021
UR  - https://arxiv.org/abs/2609.09021
AB  - We show that data censored by linear constraints can be fit within the generalized linear model (GLM) framework, recovering the expected latent counts together with their uncertainty in a single Fisher-scoring procedure. Our motivating application is origin-destination (OD) estimation in transportation studies, where the latent data are the OD trip demands and constraints are either origin and destination marginal counts per zone, as in OD matrix estimation, or observed link counts, as in network tomography. Casting the problem as a linearly constrained GLM lets us treat, within one model, three features that arise routinely in practice: unmatched constraints, trip predictors such as costs, and prior information such as diagonal dominance and seed counts. We demonstrate the methodology in synthetic and small scale studies and in a larger case study based on simulated data from the BO4Mob study.
ER  -