6 citations · 10 across the 4 of their papers we have counts for
4 papers
A derivative-free -algorithm for convex finite-max problems
Warren Hare, Chayne Planiden, Claudia Sagastizábal
The -algorithm is a superlinearly convergent method for minimizing nonsmooth, convex functions. At each iteration, the algorithm works with a certain -sp…
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…
Most Convex Functions Have Unique Minimizers
C. Planiden, X. Wang
Finding the minimum and the minimizers of convex functions has been of primary concern in convex analysis since its conception. It is well-known that if a convex function has a min…