William W. Hager - Citegraph

Author Info

Name	Affiliation	Papers
WILLIAM W. HAGER	University of Florida, Department of Mathematics, PO Box 118105, 32611-8105, Gainesville, FL, USA	77
Collaborators	Citations	PageRank
74	1603	214.67
Referers	Referees	References
2467	689	736

Search Limit

1001000

Publications (77 rows)

Collaborators (74 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
The Switch Point Algorithm	0	0.34	2021
Convergence Rates For An Inexact Admm Applied To Separable Convex Optimization	0	0.34	2020
Algorithm 1003: Mongoose, A Graph Coarsening And Partitioning Library	0	0.34	2020
Bounds for integration matrices that arise in Gauss and Radau collocation	0	0.34	2019
Inexact alternating direction methods of multipliers for separable convex optimization	0	0.34	2019
Convergence rate for a Radau hp collocation method applied to constrained optimal control	0	0.34	2019
Correction to: Convergence rate for a Radau hp collocation method applied to constrained optimal control	0	0.34	2019
Modified Radau Collocation Method For Solving Optimal Control Problems With Nonsmooth Solutions Part I: Lavrentiev Phenomenon And The Search Space	0	0.34	2018
Modified Radau Collocation Method For Solving Optimal Control Problems With Nonsmooth Solutions Part Ii: Costate Estimation And The Transformed Adjoint System	0	0.34	2018
Adaptive Mesh Refinement Method for Optimal Control Using Decay Rates of Legendre Polynomial Coefficients.	1	0.36	2018
A Pseudospectral Method For Optimal Control Based On Collocation At The Gauss Points	0	0.34	2018
Convergence Rate for a Gauss Collocation Method Applied to Constrained Optimal Control.	0	0.34	2018
Projection onto a Polyhedron that Exploits Sparsity.	3	0.43	2016
An O(1/k) Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm.	0	0.34	2016
Projection algorithms for nonconvex minimization with application to sparse principal component analysis.	0	0.34	2016
Convergence Rate for a Gauss Collocation Method Applied to Unconstrained Optimal Control.	4	0.48	2016
An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem.	3	0.41	2016
Adaptive mesh refinement method for optimal control using nonsmoothness detection and mesh size reduction	9	0.75	2015
Continuous quadratic programming formulations of optimization problems on graphs.	8	0.50	2015
A Multilevel Bilinear Programming Algorithm For the Vertex Separator Problem.	4	0.41	2014
Error estimation in nonlinear optimization	2	0.52	2014
An efficient gradient method using the Yuan steplength	17	1.00	2014
An affine scaling method for optimization problems with polyhedral constraints	1	0.35	2014
An hp mesh refinement method for optimal control using discontinuity detection and mesh size reduction	5	0.69	2014
Optimality conditions for maximizing a function over a polyhedron	4	0.42	2014
Projection algorithms for non-convex minimization, with application to sparse principal component analysis.	1	0.36	2014
A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators.	0	0.34	2013
Bregman operator splitting with variable stepsize for total variation image reconstruction	7	0.52	2013
The Limited Memory Conjugate Gradient Method.	26	0.83	2013
Fast Algorithms for Image Reconstruction with Application to Partially Parallel MR Imaging	5	0.46	2012
Partially parallel MR image reconstruction using sensitivity encoding	0	0.34	2012
Direct trajectory optimization and costate estimation of finite-horizon and infinite-horizon optimal control problems using a Radau pseudospectral method	42	3.68	2011
Pseudospectral methods for solving infinite-horizon optimal control problems	17	1.43	2011
An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines	6	0.46	2011
Gradient-Based Methods for Sparse Recovery	13	0.77	2011
A unified framework for the numerical solution of optimal control problems using pseudospectral methods	57	3.77	2010
Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves	28	2.12	2009
An exact algorithm for graph partitioning	16	0.72	2009
An affine-scaling interior-point CBB method for box-constrained optimization	20	1.03	2009
An Ellipsoidal Branch and Bound Algorithm for Global Optimization	5	0.52	2009
The generalized triangular decomposition	18	1.02	2008
A sparse proximal implementation of the LP dual active set algorithm	6	0.98	2008
Dual multilevel optimization	4	0.85	2008
Optimization of Generalized Mean-Square Error in Noisy Linear Estimation	0	0.34	2008
COAP 2007 Best Paper Award	0	0.34	2008
Self-adaptive inexact proximal point methods	12	0.73	2008
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate	209	10.73	2008
Asymptotic Convergence Analysis of a New Class of Proximal Point Methods	7	0.65	2007
Domain Decomposition for Electronic Structure Computations	0	0.34	2007
A New Active Set Algorithm for Box Constrained Optimization	74	2.89	2006

1
2
50 / page