2 citations · 3 across the 11 of their papers we have counts for
12 papers
Error bounds for perspective cones of a class of nonnegative Legendre functions
Xiaozhou Wang, Bruno F. Lourenço, Ting Kei Pong
Error bounds play a central role in the study of conic optimization problems, including the analysis of convergence rates for numerous algorithms. Curiously, those error bounds are…
Convergence analysis for a variant of manifold proximal point algorithm based on Kurdyka-Łojasiewicz property
Peiran Yu, Liaoyuan Zeng, Ting Kei Pong
We incorporate an iteratively reweighted strategy in the manifold proximal point algorithm (ManPPA) in [12] to solve an enhanced sparsity inducing model for identifying sparse yet…
A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees
Chuan He, Zhaosong Lu, Ting Kei Pong
In this paper we consider finding a second-order stationary point (SOSP) of nonconvex equality constrained optimization when a nearly feasible point is known. In particular, we fir…
A hybrid penalty method for a class of optimization problems with multiple rank constraints
Tianxiang Liu, Ivan Markovsky, Ting Kei Pong +1
In this paper, we consider the problem of minimizing a smooth objective over multiple rank constraints on Hankel-structured matrices. This kind of problems arises in system identif…
A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
Chen Chen, Ting Kei Pong, Lulin Tan +1
The split feasibility problem is to find an element in the intersection of a closed set and the linear preimage of another closed set , assuming the projections onto and…
Kurdyka-Łojasiewicz exponent via inf-projection
Peiran Yu, Guoyin Li, Ting Kei Pong
Kurdyka-Lojasiewicz (KL) exponent plays an important role in estimating the convergence rate of many contemporary first-order methods. In particular, a KL exponent of for…
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…
Eigenvalue, Quadratic Programming, and Semidefinite Programming Bounds for a Cut Minimization Problem
Ting Kei Pong, Hao Sun, Ningchuan Wang +1
We consider the problem of partitioning the node set of a graph into sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the -th set. If the re…
An Alternating Direction Method for Finding Dantzig Selectors
Zhaosong Lu, Ting Kei Pong, Yong Zhang
In this paper, we study the alternating direction method for finding the Dantzig selectors, which are first introduced in [8]. In particular, at each iteration we apply the nonmono…