Warren L. Hare
Orcid: 0000-0002-4240-3903Affiliations:
- University of British Columbia, Vancouver, Canada
According to our database1,
Warren L. Hare
authored at least 51 papers
between 2005 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on web.ubc.ca
On csauthors.net:
Bibliography
2023
Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization.
Optim. Lett., November, 2023
Optim. Lett., September, 2023
A Hybrid Direct Search and Model-Based Derivative-Free Optimization Method with Dynamic Decision Processing and Application in Solid-Tank Design.
Algorithms, February, 2023
About the Performance of a Calculus-Based Approach to Building Model Functions in a Derivative-Free Trust-Region Algorithm.
Algorithms, February, 2023
Modeling side slopes in vertical alignment resource road construction using convex optimization.
Comput. Aided Civ. Infrastructure Eng., January, 2023
Using orthogonally structured positive bases for constructing positive k-spanning sets with cosine measure guarantees.
CoRR, 2023
2022
Comput. Oper. Res., 2022
A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design.
Comput. Optim. Appl., 2022
2021
Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in R.
J. Comput. Appl. Math., 2021
CoRR, 2021
Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in R^n.
CoRR, 2021
2020
SIAM J. Optim., 2020
Optim. Methods Softw., 2020
A deterministic algorithm to compute the cosine measure of a finite positive spanning set.
Optim. Lett., 2020
Error bounds for overdetermined and underdetermined generalized centred simplex gradients.
CoRR, 2020
Fast feasibility check of the multi-material vertical alignment problem in road design.
Comput. Optim. Appl., 2020
2019
"Active-set complexity" of proximal gradient: How long does it take to find the sparsity pattern?
Optim. Lett., 2019
Constrained multi-objective optimization algorithms: Review and comparison with application in reinforced concrete structures.
Appl. Soft Comput., 2019
2018
Methods to compare expensive stochastic optimization algorithms with random restarts.
J. Glob. Optim., 2018
2017
Visualization of the \(\varepsilon \) -subdifferential of piecewise linear-quadratic functions.
Comput. Optim. Appl., 2017
2016
Eur. J. Oper. Res., 2016
Comput. Optim. Appl., 2016
2015
Optim. Methods Softw., 2015
A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction.
Eur. J. Oper. Res., 2015
Comput. Oper. Res., 2015
2014
Numerical Analysis of <i>V</i><i>U</i>-Decomposition, <i>U</i>-Gradient, and <i>U</i>-Hessian Approximations.
SIAM J. Optim., 2014
SIAM J. Control. Optim., 2014
J. Optim. Theory Appl., 2014
Models and strategies for efficiently determining an optimal vertical alignment of roads.
Comput. Oper. Res., 2014
2013
Optim. Methods Softw., 2013
A derivative-free approximate gradient sampling algorithm for finite minimax problems.
Comput. Optim. Appl., 2013
Adv. Eng. Softw., 2013
2012
J. Approx. Theory, 2012
2011
Using simulation to model and optimize acute care access in relation to hospital bed count and bed distribution.
J. Simulation, 2011
Models and algorithms to improve earthwork operations in road design using mixed integer linear programming.
Eur. J. Oper. Res., 2011
Proceedings of the Fixed-Point Algorithms for Inverse Problems in Science and Engineering, 2011
2010
SIAM J. Optim., 2010
2009
SIAM J. Optim., 2009
2007
2006
Comput. Optim. Appl., 2006
2005