Warren Hare
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Warren Hare has a total of 73 co-authors. Here are the top co-authors by number of shared publications:
- Charles Audet
GERAD and Département de Mathématiques et Génie Industriel, École Polytechnique de Montréal, Montreal, Canada
9 shared publications - Gabriel Jarry-Bolduc
Department of Mathematics and Computing, Mount Royal University , Calgary, Alberta, T3E 6K6
8 shared publications - Yves Lucet
Computer Science, University of British Columbia Okanagan, Kelowna, BC V1V 1V7, Canada
8 shared publications - Chayne Planiden
School of Mathematics and Applied Statistics, University of Wollongong, Wollongong, Australia
6 shared publications - Yiwen Chen
Department of Mathematics, University of British Columbia, Kelowna V1V 1V7, BC, Canada
6 shared publications - Heinz H. Bauschke
Mathematics, University of British Columbia, Kelowna, B.C. V1V 1V7, Canada
5 shared publications
Latest Publications
- Open Access
- 1 October 2026
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 14
On the computation of cosine measures in high dimensions
- 1 October 2026
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 14
Open AccessOn the computation of cosine measures in high dimensions
- 19 May 2026
- Published by Springer Nature in Optimization Letters
- Vol. 20 (7) , 1437-1456
A summary of benchmarking constrained, multi-objective and surrogate-assisted optimization methods
- 19 May 2026
- Published by Springer Nature in Optimization Letters
- Vol. 20 (7) , 1437-1456
A summary of benchmarking constrained, multi-objective and surrogate-assisted optimization methods
- 12 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 40 (2) , 680-705
Determining Inscribability of Polytopes via Rank Minimization Based on Slack Matrices
A polytope is inscribable if there is a realization where all vertices lie on the sphere. In this paper, we provide a necessary and sufficient condition for a polytope to be inscribable. ...
- 12 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 40 (2) , 680-705
Determining Inscribability of Polytopes via Rank Minimization Based on Slack Matrices
A polytope is inscribable if there is a realization where all vertices lie on the sphere. In this paper, we provide a necessary and sufficient condition for a polytope to be inscribable. ...
- Open Access
- 4 May 2026
- Published by Elsevier in Computer-Aided Civil and Infrastructure Engineering
- Vol. 49
Optimal network topology and alignment design for minimizing construction costs of wind farm access roads
- 4 May 2026
- Published by Elsevier in Computer-Aided Civil and Infrastructure Engineering
- Vol. 49
Open AccessOptimal network topology and alignment design for minimizing construction costs of wind farm access roads
- 17 September 2025
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (8) , 1-28
A unified vertical alignment and earthwork model in road design with a new convex optimization model for road networks
- 17 September 2025
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (8) , 1-28
A unified vertical alignment and earthwork model in road design with a new convex optimization model for road networks
- 29 August 2025
- Published by Taylor & Francis in Optimization Methods and Software
- p. 1-28
A general framework for floating point error analysis of first-order simplex derivatives
- 29 August 2025
- Published by Taylor & Francis in Optimization Methods and Software
- p. 1-28
A general framework for floating point error analysis of first-order simplex derivatives
- Open Access
CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization
This paper proposes a random subspace trust-region algorithm for general convex-constrained derivative-free optimization (DFO) problems. Similar to previous random subspace DFO methods, the convergence of our algorithm requires a certain accuracy of models and a certain quality of subspaces. For model accuracy, we define a new class of models that is only required to provide reasonable accuracy on the projection of the constraint set onto the subspace. We provide a new geometry measure to make these models easy to analyze, construct, and manage. For subspace quality, we use the concentration on the Grassmann manifold to provide a method to sample subspaces that preserve the first-order criticality measure by a certain percentage with a certain probability lower bound. Based on all these new theoretical results, we present an almost-sure global convergence and a worst-case complexity analysis of our algorithm. Numerical experiments on problems with dimensions up to 10000 demonstrate the reliable performance of our algorithm in high dimensions.
Open AccessCLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization
This paper proposes a random subspace trust-region algorithm for general convex-constrained derivative-free optimization (DFO) problems. Similar to previous random subspace DFO methods, the convergence of our algorithm requires a certain accuracy of models and a certain quality of subspaces. For model accuracy, we define a new class of models that is only required to provide reasonable accuracy on the projection of the constraint set onto the subspace. We provide a new geometry measure to make these models easy to analyze, construct, and manage. For subspace quality, we use the concentration on the Grassmann manifold to provide a method to sample subspaces that preserve the first-order criticality measure by a certain percentage with a certain probability lower bound. Based on all these new theoretical results, we present an almost-sure global convergence and a worst-case complexity analysis of our algorithm. Numerical experiments on problems with dimensions up to 10000 demonstrate the reliable performance of our algorithm in high dimensions.
- 6 June 2025
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 92 (1) , 125-153
The cosine measure relative to a subspace
- 6 June 2025
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 92 (1) , 125-153
The cosine measure relative to a subspace