Ting Kei Pong

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Calculus of the Exponent of Kurdyka-Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods.
Foundations of Computational Mathematics, 2018

A proximal difference-of-convex algorithm with extrapolation.
Comp. Opt. and Appl., 2018

2017
Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems.
SIAM Journal on Optimization, 2017

Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction.
SIAM J. Imaging Sciences, 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.
Comp. Opt. and Appl., 2017

Peaceman-Rachford splitting for a class of nonconvex optimization problems.
Comp. Opt. and Appl., 2017

2016
Penalty Methods for a Class of Non-Lipschitz Optimization Problems.
SIAM Journal on Optimization, 2016

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

Social Resistance.
Computing in Science and Engineering, 2016

Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem.
Comp. Opt. and Appl., 2016

2015
Global Convergence of Splitting Methods for Nonconvex Composite Optimization.
SIAM Journal on Optimization, 2015

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

2014
Gauge Optimization and Duality.
SIAM Journal on Optimization, 2014

Splitting methods for nonconvex composite optimization.
CoRR, 2014

The generalized trust region subproblem.
Comp. Opt. and Appl., 2014

Robust least square semidefinite programming with applications.
Comp. Opt. and Appl., 2014

2013
Computing Optimal Experimental Designs via Interior Point Method.
SIAM J. Matrix Analysis Applications, 2013

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

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

2012
An alternating direction method for finding Dantzig selectors.
Computational Statistics & Data Analysis, 2012

Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints.
Comp. Opt. and Appl., 2012

Comparing SOS and SDP relaxations of sensor network localization.
Comp. Opt. and Appl., 2012

2011
Minimizing Condition Number via Convex Programming.
SIAM J. Matrix Analysis Applications, 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 Journal on Optimization, 2010

2008
Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization.
SIAM Journal on Optimization, 2008

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


  Loading...