default search action
Warren L. Hare
Person information
- affiliation: University of British Columbia, Vancouver, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j47]Yiwen Chen, Warren L. Hare, Amy Wiebe:
Q-fully quadratic modeling and its application in a random subspace derivative-free method. Comput. Optim. Appl. 89(2): 317-360 (2024) - [j46]Yiwen Chen
, Warren L. Hare
Error Analysis of Surrogate Models Constructed Through Operations on Submodels. Math. Oper. Res. 49(1): 1-18 (2024) - [i7]Yiwen Chen, Warren L. Hare, Amy Wiebe:
A general framework for floating point error analysis of simplex derivatives. CoRR abs/2406.04530 (2024) - 2023
- [j45]Warren L. Hare
About the Performance of a Calculus-Based Approach to Building Model Functions in a Derivative-Free Trust-Region Algorithm. Algorithms 16(2): 84 (2023) - [j44]Zhongda Huang, Andy Ogilvy, Steve Collins, Warren L. Hare
A Hybrid Direct Search and Model-Based Derivative-Free Optimization Method with Dynamic Decision Processing and Application in Solid-Tank Design. Algorithms 16(2): 92 (2023) - [j43]Nusrat Suzana Momo, Warren L. Hare, Yves Lucet:
Modeling side slopes in vertical alignment resource road construction using convex optimization. Comput. Aided Civ. Infrastructure Eng. 38(2): 211-224 (2023) - [j42]Warren L. Hare
Nicely structured positive bases with maximal cosine measure. Optim. Lett. 17(7): 1495-1515 (2023) - [j41]Warren L. Hare, Clément W. Royer
Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization. Optim. Lett. 17(8): 1739-1756 (2023) - [i6]Warren L. Hare, Gabriel Jarry-Bolduc, Chayne Planiden:
A matrix algebra approach to approximate Hessians. CoRR abs/2304.03222 (2023) - [i5]Warren L. Hare, Gabriel Jarry-Bolduc, Sébastien Kerleau, Clément W. Royer:
Using orthogonally structured positive bases for constructing positive k-spanning sets with cosine measure guarantees. CoRR abs/2306.06383 (2023) - 2022
- [j40]Dominique Monnet
A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design. Comput. Optim. Appl. 81(3): 741-767 (2022) - [j39]Ayazhan Akhmet, Warren L. Hare
Bi-objective optimization for road vertical alignment design. Comput. Oper. Res. 143: 105764 (2022) - 2021
- [j38]Phillip Braun, Warren L. Hare, Gabriel Jarry-Bolduc:
Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in R. J. Comput. Appl. Math. 386: 113218 (2021) - [i4]Warren L. Hare, Gabriel Jarry-Bolduc, Chayne Planiden:
Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in R^n. CoRR abs/2104.00748 (2021) - [i3]Yiwen Chen, Gabriel Jarry-Bolduc, Warren L. Hare:
Error Analysis of Surrogate Models Constructed through Operations on Sub-models. CoRR abs/2112.08411 (2021) - 2020
- [j37]Dominique Monnet
Fast feasibility check of the multi-material vertical alignment problem in road design. Comput. Optim. Appl. 75(2): 515-536 (2020) - [j36]Warren L. Hare
A deterministic algorithm to compute the cosine measure of a finite positive spanning set. Optim. Lett. 14(6): 1305-1316 (2020) - [j35]Warren L. Hare
A derivative-free VU-algorithm for convex finite-max problems. Optim. Methods Softw. 35(3): 521-559 (2020) - [j34]Warren L. Hare
Calculus Identities for Generalized Simplex Gradients: Rules and Applications. SIAM J. Optim. 30(1): 853-884 (2020) - [i2]Warren L. Hare, Gabriel Jarry-Bolduc, Chayne Planiden:
Error bounds for overdetermined and underdetermined generalized centred simplex gradients. CoRR abs/2006.00742 (2020)
2010 – 2019
- 2019
- [j33]Hamid Afshari
Constrained multi-objective optimization algorithms: Review and comparison with application in reinforced concrete structures. Appl. Soft Comput. 83 (2019) - [j32]Julie Nutini, Mark Schmidt, Warren L. Hare:
"Active-set complexity" of proximal gradient: How long does it take to find the sparsity pattern? Optim. Lett. 13(4): 645-655 (2019) - 2018
- [j31]Warren L. Hare
Methods to compare expensive stochastic optimization algorithms with random restarts. J. Glob. Optim. 72(4): 781-801 (2018) - 2017
- [j30]Anuj Bajaj, Warren L. Hare, Yves Lucet:
Visualization of the \(\varepsilon \) -subdifferential of piecewise linear-quadratic functions. Comput. Optim. Appl. 67(2): 421-442 (2017) - [j29]Warren L. Hare:
Compositions of convex functions and fully linear models. Optim. Lett. 11(7): 1217-1227 (2017) - 2016
- [j28]Warren L. Hare, Claudia A. Sagastizábal
A proximal bundle method for nonsmooth nonconvex functions with inexact information. Comput. Optim. Appl. 63(1): 1-28 (2016) - [j27]Yasha Pushak, Warren L. Hare, Yves Lucet:
Multiple-path selection for new highway alignments using discrete algorithms. Eur. J. Oper. Res. 248(2): 415-427 (2016) - [j26]Heinz H. Bauschke
On the Range of the Douglas-Rachford Operator. Math. Oper. Res. 41(3): 884-897 (2016) - [j25]Warren L. Hare, H. Song:
On the cardinality of positively linearly independent sets. Optim. Lett. 10(4): 649-654 (2016) - [j24]Warren L. Hare, Brian J. Williams
Comment: The NoMax Strategy and Correlated Outputs. Technometrics 58(1): 22-25 (2016) - 2015
- [j23]Sukanto Mondal, Yves Lucet, Warren L. Hare:
Optimizing horizontal alignment of roads in a specified corridor. Comput. Oper. Res. 64: 130-138 (2015) - [j22]Warren L. Hare, Yves Lucet, Faisal Rahman:
A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction. Eur. J. Oper. Res. 241(3): 631-641 (2015) - [j21]Heinz H. Bauschke
A derivative-free comirror algorithm for convex optimization. Optim. Methods Softw. 30(4): 706-726 (2015) - [i1]Yasha Pushak, Warren L. Hare, Yves Lucet:
Multiple-Path Selection for new Highway Alignments using Discrete Algorithms. CoRR abs/1508.03064 (2015) - 2014
- [j20]Warren L. Hare, Shahadat Hossain, Yves Lucet, Faisal Rahman:
Models and strategies for efficiently determining an optimal vertical alignment of roads. Comput. Oper. Res. 44: 161-173 (2014) - [j19]Warren L. Hare, Yves Lucet:
Derivative-Free Optimization Via Proximal Point Methods. J. Optim. Theory Appl. 160(1): 204-220 (2014) - [j18]Warren L. Hare, Chayne Planiden:
The NC-proximal average for multiple functions. Optim. Lett. 8(3): 849-860 (2014) - [j17]Heinz H. Bauschke
Generalized Solutions for the Sum of Two Maximally Monotone Operators. SIAM J. Control. Optim. 52(2): 1034-1047 (2014) - [j16]Warren L. Hare:
Numerical Analysis of VU-Decomposition, U-Gradient, and U-Hessian Approximations. SIAM J. Optim. 24(4): 1890-1913 (2014) - 2013
- [j15]Warren L. Hare, Julie Nutini, Solomon Tesfamariam:
A survey of non-gradient optimization methods in structural engineering. Adv. Eng. Softw. 59: 19-28 (2013) - [j14]Warren L. Hare, Julie Nutini:
A derivative-free approximate gradient sampling algorithm for finite minimax problems. Comput. Optim. Appl. 56(1): 1-38 (2013) - [j13]Chad Davis, Warren L. Hare:
Exploiting Known Structures to Approximate Normal Cones. Math. Oper. Res. 38(4): 665-681 (2013) - [j12]Warren L. Hare, Mason S. Macklem:
Derivative-free optimization methods for finite minimax problems. Optim. Methods Softw. 28(2): 300-312 (2013) - 2012
- [j11]Heinz H. Bauschke
Attouch-Théra duality revisited: Paramonotonicity and operator splitting. J. Approx. Theory 164(8): 1065-1084 (2012) - 2011
- [j10]Warren L. Hare, Valentin R. Koch, Yves Lucet:
Models and algorithms to improve earthwork operations in road design using mixed integer linear programming. Eur. J. Oper. Res. 215(2): 470-480 (2011) - [j9]Y. Wang, Warren L. Hare, L. Vertesi, Alexander R. Rutherford:
Using simulation to model and optimize acute care access in relation to hospital bed count and bed distribution. J. Simulation 5(2): 101-110 (2011) - [p1]Warren L. Hare:
Identifying Active Manifolds in Regularization Problems. Fixed-Point Algorithms for Inverse Problems in Science and Engineering 2011: 261-271 - 2010
- [j8]Warren L. Hare, M. J. J. Liu, Tamás Terlaky
Efficient preprocessing for VLSI optimization problems. Comput. Optim. Appl. 45(3): 475-493 (2010) - [j7]Warren L. Hare, Claudia A. Sagastizábal
A Redistributed Proximal Bundle Method for Nonconvex Optimization. SIAM J. Optim. 20(5): 2442-2473 (2010)
2000 – 2009
- 2009
- [j6]Warren L. Hare:
A proximal method for identifying active manifolds. Comput. Optim. Appl. 43(2): 295-306 (2009) - [j5]Warren L. Hare, Claudia A. Sagastizábal
Computing proximal points of nonconvex functions. Math. Program. 116(1-2): 221-258 (2009) - [j4]Warren L. Hare:
A Proximal Average for Nonconvex Functions: A Proximal Stability Perspective. SIAM J. Optim. 20(2): 650-666 (2009) - 2007
- [j3]Warren L. Hare, Adrian S. Lewis:
Identifying Active Manifolds. Algorithmic Oper. Res. 2(2): 75-82 (2007) - 2006
- [j2]Warren L. Hare:
Functions and Sets of Smooth Substructure: Relationships and Examples. Comput. Optim. Appl. 33(2-3): 249-270 (2006) - 2005
- [j1]Warren L. Hare, Adrian S. Lewis:
Estimating Tangent and Normal Cones Without Calculus. Math. Oper. Res. 30(4): 785-799 (2005)
Coauthor Index
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-10-22 20:14 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: