-
Convex Optimization with Unbounded Nonconvex Oracles using Simulated Annealing
The dataset is used to test the algorithm for minimizing a convex objective function with noisy oracle. -
Enhanced Low-Rank Matrix Approximation
This letter proposes to estimate low-rank matrices by formulating a convex optimization problem with non-convex regularization. We employ parameterized non-convex penalty...