default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam W. Hager
- > Home > Persons > William W. Hager
Publications
- 2021
[j77]Joseph D. Eide, William W. Hager
, Anil V. Rao:
Modified Legendre-Gauss-Radau Collocation Method for Optimal Control Problems with Nonsmooth Solutions. J. Optim. Theory Appl. 191(2): 600-633 (2021)- 2020
- [j74]Timothy A. Davis, William W. Hager, Scott P. Kolodziej, Sencer Nuri Yeralan:
Algorithm 1003: Mongoose, a Graph Coarsening and Partitioning Library. ACM Trans. Math. Softw. 46(1): 7:1-7:18 (2020) - 2019
- [j71]William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao, Xiang-Sheng Wang:
Convergence rate for a Radau hp collocation method applied to constrained optimal control. Comput. Optim. Appl. 74(1): 275-314 (2019) - [j70]William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao, Xiang-Sheng Wang:
Correction to: Convergence rate for a Radau hp collocation method applied to constrained optimal control. Comput. Optim. Appl. 74(1): 315-316 (2019) - 2018
- [j69]William W. Hager, James T. Hungerford, Ilya Safro:
A multilevel bilinear programming algorithm for the vertex separator problem. Comput. Optim. Appl. 69(1): 189-223 (2018) - [j68]William W. Hager, Jun Liu, Subhashree Mohapatra, Anil V. Rao, Xiang-Sheng Wang:
Convergence Rate for a Gauss Collocation Method Applied to Constrained Optimal Control. SIAM J. Control. Optim. 56(2): 1386-1411 (2018) - [j67]Fengjin Liu, William W. Hager, Anil V. Rao:
Adaptive Mesh Refinement Method for Optimal Control Using Decay Rates of Legendre Polynomial Coefficients. IEEE Trans. Control. Syst. Technol. 26(4): 1475-1483 (2018) - [c12]Joseph D. Eide, William W. Hager, Anil V. Rao:
Modified Radau Collocation method for Solving Optimal Control Problems with Nonsmooth Solutions Part I: Lavrentiev Phenomenon and the Search Space. CDC 2018: 1644-1650 - [c11]Joseph D. Eide, William W. Hager, Anil V. Rao:
Modified Radau Collocation Method for Solving Optimal Control Problems with Nonsmooth Solutions Part II: Costate Estimation and the Transformed Adjoint System. CDC 2018: 1651-1656 - [c10]William W. Hager, Jun Liu, Subhashree Mohapatra, Anil V. Rao, Xiang-Sheng Wang:
A pseudospectral method for optimal control based on collocation at the Gauss points. CDC 2018: 2490-2495 - 2016
- [j65]William W. Hager, Hongyan Hou, Anil V. Rao:
Convergence Rate for a Gauss Collocation Method Applied to Unconstrained Optimal Control. J. Optim. Theory Appl. 169(3): 801-824 (2016) - [j62]Timothy A. Davis, William W. Hager, James T. Hungerford:
An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem. ACM Trans. Math. Softw. 42(3): 22:1-22:25 (2016) - 2015
- [j61]William W. Hager, James T. Hungerford:
Continuous quadratic programming formulations of optimization problems on graphs. Eur. J. Oper. Res. 240(2): 328-337 (2015) - [j60]Fengjin Liu, William W. Hager, Anil V. Rao:
Adaptive mesh refinement method for optimal control using nonsmoothness detection and mesh size reduction. J. Frankl. Inst. 352(10): 4081-4106 (2015) - 2014
- [j56]William W. Hager, James T. Hungerford:
Optimality conditions for maximizing a function over a polyhedron. Math. Program. 145(1-2): 179-198 (2014) - [c9]Fengjin Liu, William W. Hager, Anil V. Rao:
An hp mesh refinement method for optimal control using discontinuity detection and mesh size reduction. CDC 2014: 5868-5873 - [c8]William W. Hager, James T. Hungerford, Ilya Safro:
A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators. LION 2014: 77-81 - [i3]William W. Hager, James T. Hungerford, Ilya Safro:
A Multilevel Bilinear Programming Algorithm For the Vertex Separator Problem. CoRR abs/1410.4885 (2014) - 2013
- [c7]Camila Francolin, Hongyan Hou, William W. Hager, Anil V. Rao:
Costate estimation of state-inequality path constrained optimal control problems using collocation at Legendre-Gauss-Radau points. CDC 2013: 6469-6474 - [i2]William W. Hager, James T. Hungerford, Ilya Safro:
A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators. CoRR abs/1311.5930 (2013) - 2011
- [j51]Divya Garg, William W. Hager, Anil V. Rao:
Pseudospectral methods for solving infinite-horizon optimal control problems. Autom. 47(4): 829-837 (2011) - [j50]Divya Garg, Michael A. Patterson, Camila Francolin, Christopher Darby, Geoffrey T. Huntington, William W. Hager, Anil V. Rao:
Direct trajectory optimization and costate estimation of finite-horizon and infinite-horizon optimal control problems using a Radau pseudospectral method. Comput. Optim. Appl. 49(2): 335-358 (2011) - 2010
- [j47]Divya Garg, Michael A. Patterson, William W. Hager, Anil V. Rao, David A. Benson, Geoffrey T. Huntington:
A unified framework for the numerical solution of optimal control problems using pseudospectral methods. Autom. 46(11): 1843-1851 (2010) - 2009
- [j43]Timothy A. Davis, William W. Hager:
Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves. ACM Trans. Math. Softw. 35(4): 27:1-27:23 (2009) - 2008
- [j38]Timothy A. Davis, William W. Hager:
A sparse proximal implementation of the LP dual active set algorithm. Math. Program. 112(2): 275-301 (2008) - [j37]Timothy A. Davis, William W. Hager:
Dual multilevel optimization. Math. Program. 112(2): 403-425 (2008) - [j35]Yanqing Chen, Timothy A. Davis, William W. Hager, Sivasankaran Rajamanickam:
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate. ACM Trans. Math. Softw. 35(3): 22:1-22:14 (2008) - 2005
- [j25]Timothy A. Davis, William W. Hager:
Row Modifications of a Sparse Cholesky Factorization. SIAM J. Matrix Anal. Appl. 26(3): 621-639 (2005) - 2001
- [j15]Timothy A. Davis, William W. Hager:
Multiple-Rank Modifications of a Sparse Cholesky Factorization. SIAM J. Matrix Anal. Appl. 22(4): 997-1013 (2001) - 1999
- [j6]Timothy A. Davis, William W. Hager:
Modifying a Sparse Cholesky Factorization. SIAM J. Matrix Anal. Appl. 20(3): 606-627 (1999)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 19:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
