194 citations · 422 across the 29 of their papers we have counts for
5 papers · 1 filter
Compositions of Convex Functions and Fully Linear Models
Warren Hare
Derivative-free optimization (DFO) is the mathematical study of the optimization algorithms that do not use derivatives. One branch of DFO focuses on model-based DFO methods, where…
Thresholds of Prox-Boundedness of PLQ functions
Warren Hare, Chayne Planiden
Introduced in the 1960s, the Moreau envelope has grown to become a key tool in non\-smooth analysis and optimization. Essentially an infimal convolution with a parametrized norm sq…
Computing proximal points of convex functions with inexact subgradients
Warren Hare, Chayne Planiden
Locating proximal points is a component of numerous minimization algorithms. This work focuses on developing a method to find the proximal point of a convex function at a point, gi…
Algorithmic construction of the subdifferential from directional derivatives
Charles Audet, Warren Hare
The subdifferential of a function is a generalization for nonsmooth functions of the concept of gradient. It is frequently used in variational analysis, particularly in the context…
A bi-objective optimization framework for three-dimensional road alignment design
D. Hirpa, W. Hare, Y. Lucet +2
Optimization of three-dimensional road alignments is a nonlinear non-convex optimization problem. The development of models that fully optimize a three-dimensional road alignment p…