default search action
Ting Kei Pong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j47]Liaoyuan Zeng, Yongle Zhang
, Guoyin Li, Ting Kei Pong, Xiaozhou Wang:
Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems. Math. Program. 208(1): 717-761 (2024) - [j46]Xiaozhou Wang
Convergence Rate Analysis of a Dykstra-Type Projection Algorithm. SIAM J. Optim. 34(1): 563-589 (2024) - [j45]Ying Lin, Scott B. Lindstrom, Bruno F. Lourenço
Generalized Power Cones: Optimal Error Bounds and Automorphisms. SIAM J. Optim. 34(2): 1316-1340 (2024) - [i6]Ying Lin, Scott B. Lindstrom, Bruno F. Lourenço, Ting Kei Pong:
Tight error bounds for log-determinant cones without constraint qualifications. CoRR abs/2403.07295 (2024) - 2023
- [j44]Yongle Zhang, Guoyin Li, Ting Kei Pong, Shiqi Xu:
Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints. Adv. Comput. Math. 49(1): 8 (2023) - [j43]Shuqin Sun, Ting Kei Pong
Doubly iteratively reweighted algorithm for constrained compressed sensing models. Comput. Optim. Appl. 85(2): 583-619 (2023) - [j42]Tianxiang Liu
Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints. Comput. Optim. Appl. 86(2): 521-553 (2023) - [j41]Scott B. Lindstrom
Error bounds, facial residual functions and applications to the exponential cone. Math. Program. 200(1): 229-278 (2023) - [j40]Chuan He
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. 33(3): 1734-1766 (2023) - [i5]Chuan He, Zhaosong Lu
A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees. CoRR abs/2301.03139 (2023) - 2022
- [j39]Liaoyuan Zeng, Ting Kei Pong
ρ-regularization subproblems: strong duality and an eigensolver-based algorithm. Comput. Optim. Appl. 81(2): 337-368 (2022) - [j38]Peiran Yu, Guoyin Li
Kurdyka-Łojasiewicz Exponent via Inf-projection. Found. Comput. Math. 22(4): 1171-1217 (2022) - 2021
- [j37]Xinxin Li, Ting Kei Pong
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem. Comput. Optim. Appl. 78(3): 853-891 (2021) - [j36]Liaoyuan Zeng, Peiran Yu, Ting Kei Pong
Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization. SIAM J. Optim. 31(2): 1576-1603 (2021) - [j35]Peiran Yu, Ting Kei Pong
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. 31(3): 2024-2054 (2021) - [i4]Scott B. Lindstrom, Bruno F. Lourenço, Ting Kei Pong:
Tight error bounds and facial residual functions for the p-cones and beyond. CoRR abs/2109.11729 (2021) - 2020
- [j34]João Gouveia
Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices. J. Glob. Optim. 76(2): 383-405 (2020) - [j33]Chen Chen, Ting Kei Pong
A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection. J. Glob. Optim. 78(1): 107-136 (2020) - [j32]Minglu Ye
A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set. SIAM J. Optim. 30(2): 1274-1299 (2020) - [j31]Tianxiang Liu
A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints. SIAM J. Matrix Anal. Appl. 41(3): 1260-1283 (2020)
2010 – 2019
- 2019
- [j30]Tianxiang Liu
A refined convergence analysis of \(\hbox {pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection. Comput. Optim. Appl. 73(1): 69-100 (2019) - [j29]Peiran Yu, Ting Kei Pong
Iteratively reweighted \(\ell _1\) algorithms with extrapolation. Comput. Optim. Appl. 73(2): 353-386 (2019) - [j28]Tianxiang Liu, Ting Kei Pong
A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Math. Program. 176(1-2): 339-367 (2019) - [j27]Michael P. Friedlander
Polar Convolution. SIAM J. Optim. 29(2): 1366-1391 (2019) - 2018
- [j26]Bo Wen, Xiaojun Chen
A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69(2): 297-324 (2018) - [j25]Guoyin Li
Calculus of the Exponent of Kurdyka-Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods. Found. Comput. Math. 18(5): 1199-1232 (2018) - [j24]Lei Yang
A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems. SIAM J. Optim. 28(4): 3402-3430 (2018) - 2017
- [j23]Tianxiang Liu, Ting Kei Pong
Further properties of the forward-backward envelope with applications to difference-of-convex programming. Comput. Optim. Appl. 67(3): 489-520 (2017) - [j22]Guoyin Li
Peaceman-Rachford splitting for a class of nonconvex optimization problems. Comput. Optim. Appl. 68(2): 407-436 (2017) - [j21]Xiaojun Chen, Ting Kei Pong
Two-stage stochastic variational inequalities: an ERM-solution procedure. Math. Program. 165(1): 71-111 (2017) - [j20]Lei Yang, Ting Kei Pong
Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction. SIAM J. Imaging Sci. 10(1): 74-110 (2017) - [j19]Bo Wen, Xiaojun Chen, Ting Kei Pong
Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems. SIAM J. Optim. 27(1): 124-145 (2017) - 2016
- [j18]Ting Kei Pong
Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem. Comput. Optim. Appl. 63(2): 333-364 (2016) - [j17]Michael P. Friedlander, Nathan Krislock, Ting Kei Pong
Social Resistance. Comput. Sci. Eng. 18(2): 98-103 (2016) - [j16]Guoyin Li
Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math. Program. 159(1-2): 371-401 (2016) - [j15]Xiaojun Chen
Penalty Methods for a Class of Non-Lipschitz Optimization Problems. SIAM J. Optim. 26(3): 1465-1492 (2016) - 2015
- [j14]Guoyin Li
Global Convergence of Splitting Methods for Nonconvex Composite Optimization. SIAM J. Optim. 25(4): 2434-2460 (2015) - [i3]Guoyin Li, Ting Kei Pong:
Peaceman-Rachford splitting for a class of nonconvex optimization problems. CoRR abs/1507.00887 (2015) - 2014
- [j13]Ting Kei Pong
The generalized trust region subproblem. Comput. Optim. Appl. 58(2): 273-322 (2014) - [j12]Guoyin Li
Robust least square semidefinite programming with applications. Comput. Optim. Appl. 58(2): 347-379 (2014) - [j11]Michael P. Friedlander
Gauge Optimization and Duality. SIAM J. Optim. 24(4): 1999-2022 (2014) - [i2]Guoyin Li, Ting Kei Pong:
Splitting methods for nonconvex composite optimization. CoRR abs/1407.0753 (2014) - 2013
- [j10]Maryam Fazel, Ting Kei Pong
Hankel Matrix Rank Minimization with Applications to System Identification and Realization. SIAM J. Matrix Anal. Appl. 34(3): 946-977 (2013) - [j9]Zhaosong Lu
Computing Optimal Experimental Designs via Interior Point Method. SIAM J. Matrix Anal. Appl. 34(4): 1556-1580 (2013) - [i1]Lisa Elkin, Ting Kei Pong, Stephen A. Vavasis:
Convex relaxation for finding planted influential nodes in a social network. CoRR abs/1307.4047 (2013) - 2012
- [j8]João Gouveia
Comparing SOS and SDP relaxations of sensor network localization. Comput. Optim. Appl. 52(3): 609-627 (2012) - [j7]Ting Kei Pong
Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints. Comput. Optim. Appl. 53(1): 23-44 (2012) - [j6]Zhaosong Lu
An alternating direction method for finding Dantzig selectors. Comput. Stat. Data Anal. 56(12): 4037-4046 (2012) - 2011
- [j5]Ting Kei Pong
(Robust) Edge-based semidefinite programming relaxation of sensor network localization. Math. Program. 130(2): 321-358 (2011) - [j4]Zhaosong Lu
Minimizing Condition Number via Convex Programming. SIAM J. Matrix Anal. Appl. 32(4): 1193-1211 (2011) - 2010
- [j3]Ting Kei Pong
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning. SIAM J. Optim. 20(6): 3465-3489 (2010)
2000 – 2009
- 2008
- [j2]Chong Li, Kung Fu Ng, Ting Kei Pong
Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization. SIAM J. Optim. 19(1): 163-187 (2008) - 2007
- [j1]Chong Li, Kung Fu Ng, Ting Kei Pong
The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces. SIAM J. Optim. 18(2): 643-665 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: