Ting Kei Pong
Orcid: 0000-0001-5862-2986
According to our database1,
Ting Kei Pong
authored at least 50 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
SIAM J. Optim., March, 2024
CoRR, 2024
2023
Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints.
Comput. Optim. Appl., November, 2023
A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees.
SIAM J. Optim., September, 2023
Comput. Optim. Appl., June, 2023
Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints.
Adv. Comput. Math., February, 2023
Math. Program., 2023
2022
Comput. Optim. Appl., 2022
2021
Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization.
SIAM J. Optim., 2021
Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems.
SIAM J. Optim., 2021
CoRR, 2021
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem.
Comput. Optim. Appl., 2021
2020
A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints.
SIAM J. Matrix Anal. Appl., 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. Glob. Optim., 2020
A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection.
J. Glob. Optim., 2020
2019
A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems.
Math. Program., 2019
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
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
Math. Program., 2017
Further properties of the forward-backward envelope with applications to difference-of-convex programming.
Comput. Optim. Appl., 2017
Comput. Optim. Appl., 2017
2016
SIAM J. Optim., 2016
Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems.
Math. Program., 2016
Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem.
Comput. Optim. Appl., 2016
2015
SIAM J. Optim., 2015
CoRR, 2015
2014
Comput. Optim. Appl., 2014
2013
SIAM J. Matrix Anal. Appl., 2013
Hankel Matrix Rank Minimization with Applications to System Identification and Realization.
SIAM J. Matrix Anal. Appl., 2013
CoRR, 2013
2012
Comput. Stat. Data Anal., 2012
Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints.
Comput. Optim. Appl., 2012
Comput. Optim. Appl., 2012
2011
(Robust) Edge-based semidefinite programming relaxation of sensor network localization.
Math. Program., 2011
2010
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