Solving Noisy, Large-Scale Fixed-Point Problems and Systems of Nonlinear Equations

References

• Arnott R., de Palma A., Lindsey R. Does providing information to drivers reduce traffic congestion? Transportation Res. Part A (1991) 25(5):309–318Crossref, Google Scholar
• Ascher U., Russell R. D.Numerical Boundary Value ODEs, Progress in Science Computing (1985) Vol. 5(Birkhäuser, Boston, MA) Crossref, Google Scholar
• Astarita V., Er-Rafia K., Florian M., Mahut M., Velan S. Comparison of three methods for dynamic network loading. Transportation Res. Record (2001) 1771:179–190Crossref, Google Scholar
• Banach S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundamenta Mathematicae (1922) 3:133–181Google Scholar
• Barbour R., Fricker J. D. Estimating an origin-destination table using a method based on shortest augmenting paths. Transportation Res. Part B (1994) 28(2):77–89Crossref, Google Scholar
• Bell M. G. H. The estimation of an origin-destination matrix from traffic counts. Transportation Sci. (1983) 17(2):198–217Link, Google Scholar
• Bell M. G. H., Volmuller J., Hamerslag R. Log-linear models for the estimation of origin-destination matrices from traffic counts: An approximation. Proc. 9th Internat. Sympos. Transportation Traffic Theory (1984) (VNU Science Press, Utrecht, The Netherlands) 451–470Google Scholar
• Ben-Akiva M., Bierlaire M., Hall R. Discrete choice models with applications to departure time and route choice. Handbook of Transportation Science (2003) 2nd ed.(Kluwer Academic Press, Boston/Dordrecht/London) 7–37Crossref, Google Scholar
• Ben-Akiva M. E., de Palma A., Kaysi I., Bianco L., Toth P. The impact of predictive information on guidance efficiency: An analytical approach. Advanced Methods in Transportation Analysis (1996) (Springer, Berlin, German) 413–432Crossref, Google Scholar
• Ben-Akiva M. E., Bierlaire M., Koutsopoulos H. N., Mishalani R. G. DynaMIT: A simulation-based system for traffic prediction. Proc. DACCORD Short-Term Forecasting Workshop (1998) Google Scholar
• Ben-Akiva M., Bierlaire M., Koutsopoulos H. N., Mishalani R., Gendreau M., Marcotte P. Real-time simulation of traffic demand-supply interactions within DynaMIT. Transportation and Network Analysis: Current Trends. Miscellenea in Honor of Michael Florian (2002) (Kluwer Academic Publishers, Boston/Dordrecht/London) Google Scholar
• Bierlaire M. The total demand scale: A new measure of quality for static and dynamic origin-destination trip tables. Transportation Res. Part B (2002) 36(9):837–850Crossref, Google Scholar
• Bierlaire M., Crittin F. Generalization of secant methods for solving systems of nonlinear equations. Proc. 3rd Swiss Transportation Res. Conf. (2003) Ascona, SwitzerlandGoogle Scholar
• Bierlaire M., Crittin F. An efficient algorithm for real-time estimation and prediction of dynamic OD tables. Oper. Res. (2004) 52(1):116–127Link, Google Scholar
• Bierlaire M., Toint P. L. MEUSE: An origin-destination estimator that exploits structure. Transportation Res. Part B (1995) 29(1):47–60Crossref, Google Scholar
• Bogle I., Perkins J. A new sparsity preserving quasi-Newton update for solving nonlinear equations. SIAM J. Sci. Statist. Computations (1990) 11:621–630Crossref, Google Scholar
• Bottom J. Consistent anticipatory route guidance. (2000) . Doctoral dissertation, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Bottom J., Ben-Akiva M., Bierlaire M., Chabini I., Koutsopoulos H., Yang Q., Ceder A. Investigation of route guidance generation issues by simulation with DynaMIT. Transportation and Traffic Theory. Proc. 14th ISTTT (1999) (Pergamon, New York) 577–600Google Scholar
• Broyden C. G. A class of methods for solving nonlinear simultaneous equations. Math. Comput. (1965) 19:577–593Crossref, Google Scholar
• Byrd R., Nocedal J., Schnabel R. B. Representation of quasi-Newton matrices and their use in limited memory methods. Math. Programming (1994) 63:129–136Crossref, Google Scholar
• Cantarella G. E. A general fixed-point approach to multimode multi-user equilibrium assignment with elastic demand. Transportation Sci. (1997) 31(2):107–128Link, Google Scholar
• Cascetta E. Estimation of trip matrices from traffic counts and survey data: A generalised least squares approach estimator. Transportation Res. Part B (1984) 18(4/5):289–299Crossref, Google Scholar
• Cascetta E.Transportation Systems Engineering: Theory and Methods (2001) (Kluwer Academic Publishers, Dordrecht/Boston/London) . Applied OptimizationCrossref, Google Scholar
• Cascetta E., Postorino M. Fixed point approaches to the estimation of O/D matrices using traffic counts on congested networks. Transportation Sci. (2001) 35:134–147Link, Google Scholar
• Choi T. D., Kelley C. Superlinear convergence and implicit filtering. SIAM J. Optim. (2000) 10Crossref, Google Scholar
• Crittin F. New algorithmic methods for real-time transportation problems. (2003) . Doctoral dissertation 2877, École Polytechnique Fédérale de Lausanne, Lausanne, SwitzerlandGoogle Scholar
• Dennis J. E., Moré J. J. Quasi-Newton methods, motivation and theory. SIAM Rev. (1977) 19:46–89Crossref, Google Scholar
• Dennis J. E., Schnabel R. B.Numerical Methods for Unconstrained Optimization and Nonlinear Equations (1996) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Dennis J. E., Walker H. F. Least-change sparse secant update methods with inaccurate secant conditions. SIAM J. Numerical Anal. (1985) 22(4):760–778Crossref, Google Scholar
• Dolan E. D., Moré J. J. Benchmarking optimization software with performance profiles. Math. Programming, Series A (2002) 91(2):201–213Crossref, Google Scholar
• Eaton J. W. GNU octave: A high-level interactive language for numerical computations. (1997) . www.octave.orgGoogle Scholar
• Eyert V. A comparative study on methods for convergence acceleration of iterative vector sequences. J. Computational Phys. (1996) 124:271–285Crossref, Google Scholar
• Ford J. A. A survey of multi-step quasi-Newton methods. Proc. Internat. Conf. Sci. Computations (1999) Beirut, LebanonGoogle Scholar
• Ford J. A., Moghrabi I. A. Alternating multi-step quasi-Newton methods for unconstrained optimization. J. Computational Appl. Math. (1997) 82:105–116Crossref, Google Scholar
• Friedlander A., Gomes-Ruggiero M. A., Kozakevich D. N., Martínez J. M., Santos S. A. Solving nonlinear systems of equations by means of quasi-Newton methods with a nonmonotone strategy. Optim. Methods Software (1997) 8:25–51Crossref, Google Scholar
• Golub G. H., Van Loan C. F.Matrix Computations (1989) 2nd ed.(Johns Hopkins University Press, Baltimore, MA) Google Scholar
• Gomes-Ruggiero M., Kozakevich D., Martinez J. A numerical study on large-scale nonlinear solvers. Computers Math. Appl.: An Internat. J. (1996) 32:1–13Crossref, Google Scholar
• Gomes-Ruggiero M. A., Martinez J. M., Moretti A. C. Comparing algorithms for solving sparse nonlinear systems of equations. SIAM J. Sci. Statist. Comput. (1992) 13(2):459–483Crossref, Google Scholar
• Gragg W., Stewart G. A stable variant of the secant method for solving nonlinear equations. SIAM J. Numer. Anal. (1976) 13:889–903Crossref, Google Scholar
• Hall R. W. The fastest path through a network with random time-dependent travel times. Transportation Sci. (1986) 20(3):182–188Link, Google Scholar
• Hazelton M. Estimation of origin-destination matrices from link flows on uncongested networks. Transportation Res. Part B (2000) 34(7):549–566Crossref, Google Scholar
• Johnson D. Modified Broyden’s method for accelerating convergence in self-conssistent calculations. Physical Rev. B (1988) 38(18):12807–12813Crossref, Google Scholar
• Kelley C. T. Frontiers in Applied Mathematics. Iterative Methods for Linear and Nonlinear Equations (1995) (SIAM, Philadephia, PA) Crossref, Google Scholar
• Kelley C. T.Solving Nonlinear Equations with Newton’s Method (2003) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Li G. Successive column correction algorithms for solving sparse non-linear systems of equations. Math. Programming (1989) 43:187–207Crossref, Google Scholar
• Luksan L. Inexact trust region method for large sparse systems of nonlinear equations. J. Optim. Theory Appl. (1994) 81(3):569–590Crossref, Google Scholar
• Luksan L., Vlcek J. Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations. Optim. Methods Software (1998) 8:185–199Crossref, Google Scholar
• Mahmassani H., Hu T., Peeta S., Ziliaskopoulos A. Development and testing of dynamic traffic assignment and simulation procedures for ATIS/ATMS applications. (1993) . Technical Report DTFH61-90-R-00074-FG, Center for Transportation Research, University of Texas, Austin, TXGoogle Scholar
• Martinez J. M. Three new algorithms based on the sequantial secant method. BIT (1979) 19:236–243Crossref, Google Scholar
• Martinez J. M. A quasi-Newton method with modification of one column per iteration. Computing (1984) 33:353–362Crossref, Google Scholar
• Martinez J. M. Practical quasi-Newton methods for solving nonlinear systems. J. Computational Appl. Math. (2000) 124:97–122Crossref, Google Scholar
• Martinez J. M., Zambaldi M. C. An inverse column-updating method for solving large-scale nonlinear systems of equations. Optim. Method Software (1992) 1Google Scholar
• Messmer A., Papageorgiou M. METANET: A macroscopic simulation program for motorway networks. Traffic Engrg. Control (1990) 31:466–470Google Scholar
• Moghrabi I. Multi-step quasi-Newton methods for optimization. (1993) . Doctoral dissertation, University of Essex, Essex, UKGoogle Scholar
• Moré J. J., Garbow B. S., Hillstrom K. E. Testing unconstrained optimization software. ACM Trans. Math. Software (1981) 7(1):17–41Crossref, Google Scholar
• Nocedal J., Wright S. J.Numerical Optimization. Springer Series in Operations Research (1999) (Springer-Verlag, New York) Google Scholar
• Ornstein L. S., Zernike F.Proc. Acad. Sci. (1914) Vol. 17Amsterdam:793Google Scholar
• Ortega J. M., Rheinboldt W. C.Iterative Solution of Nonlinear Equations in Several Variables (1970) (Academic Press, New York) Google Scholar
• Paige C. C., Saunders M. A. LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Software (1982) 8:43–71Crossref, Google Scholar
• Patriksson M.The Traffic Assignment Problem, Models and Methods (1994) (VSP, Utrecht, The Netherlands) Google Scholar
• Robert S. M., Shipman J. S. On the closed form solution of Troesch’s problem. J. Comput. Physics (1976) 21:291–304Crossref, Google Scholar
• Roose A., Kulla V., Lomp M., Meressoo T. Test examples of systems of non-linear equations. Estonian Software Comput. Service Company (1990) (Tallin)Google Scholar
• Saad Y., Schultz M. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Numer. Anal. (1986) 7:856–869Google Scholar
• Spedicato E., Huang Z. Numerical experience with Newton-like methods for nonlinear algebraic systems. Comput. (1997) 58:69–99Crossref, Google Scholar
• Spiess H. A maximum likelihood model for estimating origin-destination matrices. Transportation Res. Part B (1987) 21(5):395–412Crossref, Google Scholar
• Toint P. L. Numerical solution of large sets of algebraic nonlinear equations. Math. Comput. (1986) 46(173):175–189Crossref, Google Scholar
• Van Zuylen H. J., Willumsen L. G. The most likely trip matrix estimated from traffic counts. Transportation Res. Part B (1980) 14:281–293Crossref, Google Scholar
• Vanderbilt D., Louie S. G. Total energies of diamond (111) surface reconstructions by a linear combination of atomic orbitals method. Physical Rev. B (1984) 30(10):6118–6130Crossref, Google Scholar
• Wolfe P. The secant method for solving nonlinear equations. Comm. ACM (1959) 12:12–13Crossref, Google Scholar
• Yang Q., Koutsopoulos H. N. A microscopic traffic simulator for evaluation of dynamic traffic management systems. Transportation Res. Part C (1997) 4(3):113–129Crossref, Google Scholar