1 citations · 1 across the 5 of their papers we have counts for
3 papers · 1 filter
Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
Minxin Zhang, Fuqun Han, Yat Tin Chow +2
This work concerns the zeroth-order global minimization of continuous nonconvex functions with a unique global minimizer and possibly multiple local minimizers. We formulate a theo…
Block Matrix and Tensor Randomized Kaczmarz Methods for Linear Feasibility Problems
Minxin Zhang, Jamie Haddock, Deanna Needell
The randomized Kaczmarz methods are a popular and effective family of iterative methods for solving large-scale linear systems of equations, which have also been applied to linear…
Projected-Search Methods for Bound-Constrained Optimization
Michael W. Ferry, Philip E. Gill, Elizabeth Wong +1
Projected-search methods for bound-constrained optimization are based on performing a search along a piecewise-linear continuous path obtained by projecting a search direction onto…