# Ting Kei Pong

According to our database1, Ting Kei Pong authored at least 36 papers between 2007 and 2020.

Collaborative distances:
• Dijkstra number2 of four.
• Erdős number3 of four.

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2020
A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set.
SIAM J. Optim., 2020

Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices.
J. Global Optimization, 2020

A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection.
J. Global Optimization, 2020

2019
Polar Convolution.
SIAM J. Optim., 2019

A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems.
Math. Program., 2019

Iteratively reweighted $$\ell _1$$ algorithms with extrapolation.
Comput. Optim. Appl., 2019

A refined convergence analysis of $$\hbox {pDCA}_{e}$$ with applications to simultaneous sparse recovery and outlier detection.
Comput. Optim. Appl., 2019

2018
A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems.
SIAM J. Optim., 2018

Calculus of the Exponent of Kurdyka-Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods.
Found. Comput. Math., 2018

A proximal difference-of-convex algorithm with extrapolation.
Comput. Optim. Appl., 2018

2017
Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems.
SIAM J. Optim., 2017

Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction.
SIAM J. Imaging Sci., 2017

Two-stage stochastic variational inequalities: an ERM-solution procedure.
Math. Program., 2017

Further properties of the forward-backward envelope with applications to difference-of-convex programming.
Comput. Optim. Appl., 2017

Peaceman-Rachford splitting for a class of nonconvex optimization problems.
Comput. Optim. Appl., 2017

2016
Penalty Methods for a Class of Non-Lipschitz Optimization Problems.
SIAM J. Optim., 2016

Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems.
Math. Program., 2016

Social Resistance.
Comput. Sci. Eng., 2016

Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem.
Comput. Optim. Appl., 2016

2015
Global Convergence of Splitting Methods for Nonconvex Composite Optimization.
SIAM J. Optim., 2015

Peaceman-Rachford splitting for a class of nonconvex optimization problems.
CoRR, 2015

2014
Gauge Optimization and Duality.
SIAM J. Optim., 2014

Splitting methods for nonconvex composite optimization.
CoRR, 2014

The generalized trust region subproblem.
Comput. Optim. Appl., 2014

Robust least square semidefinite programming with applications.
Comput. Optim. Appl., 2014

2013
Computing Optimal Experimental Designs via Interior Point Method.
SIAM J. Matrix Anal. Appl., 2013

Hankel Matrix Rank Minimization with Applications to System Identification and Realization.
SIAM J. Matrix Anal. Appl., 2013

Convex relaxation for finding planted influential nodes in a social network.
CoRR, 2013

2012
An alternating direction method for finding Dantzig selectors.
Comput. Stat. Data Anal., 2012

Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints.
Comput. Optim. Appl., 2012

Comparing SOS and SDP relaxations of sensor network localization.
Comput. Optim. Appl., 2012

2011
Minimizing Condition Number via Convex Programming.
SIAM J. Matrix Anal. Appl., 2011

(Robust) Edge-based semidefinite programming relaxation of sensor network localization.
Math. Program., 2011

2010
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning.
SIAM J. Optim., 2010

2008
Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization.
SIAM J. Optim., 2008

2007
The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces.
SIAM J. Optim., 2007