1 citations · 1 across the 3 of their papers we have counts for
Showing 2022 · math.OCShow all
3 papers · 2 filters
math.OC2022★ 1 cited
Single-Projection Procedure for Infinite Dimensional Convex Optimization Problems
Hoa T. Bui, Regina S. Burachik, Evgeni A. Nurminski +1
In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible po…
math.OC2022
An exact cutting plane method for solving p-dispersion-sum problems
Sandy Spiers, Hoa T. Bui, Ryan Loxton
This paper aims to answer an open question recently posed in the literature, that is to find a fast exact method for solving the p-dispersion-sum problem (PDSP), a nonconcave quadr…
math.OC2022
Cutting plane algorithms for nonlinear binary optimization
Hoa T. Bui, Qun Lin, Ryan Loxton
Current state-of-the-art methods for solving discrete optimization problems are usually restricted to convex settings. In this paper, we propose a general approach based on cutting…