4 papers · 1 filter
Polar Convolution
Michael P. Friedlander, Ives Macêdo, Ting Kei Pong
The Moreau envelope is one of the key convexity-preserving functional operations in convex analysis, and it is central to the development and analysis of many approaches for convex…
Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
João Gouveia, Ting Kei Pong, Mina Saee
Motivated by the expressive power of completely positive programming to encode hard optimization problems, many approximation schemes for the completely positive cone have been pro…
A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
Minglu Ye, Ting Kei Pong
We propose a subgradient-based method for finding the maximum feasible subsystem in a collection of closed sets with respect to a given closed set (MFS). In this method, we…
A refined convergence analysis of pDCA with applications to simultaneous sparse recovery and outlier detection
Tianxiang Liu, Ting Kei Pong, Akiko Takeda
We consider the problem of minimizing a difference-of-convex (DC) function, which can be written as the sum of a smooth convex function with Lipschitz gradient, a proper closed con…