Ting Kei Pong

From MaRDI portal
Person:248011

Available identifiers

zbMath Open pong.ting-keiMaRDI QIDQ248011

List of research outcomes





PublicationDate of PublicationType
Kurdyka-Łojasiewicz exponent via Hadamard parametrization2025-01-14Paper
Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems2024-11-07Paper
Convergence Rate Analysis of a Dykstra-Type Projection Algorithm2024-02-27Paper
An extended sequential quadratic method with extrapolation2023-12-24Paper
Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints2023-10-19Paper
A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees2023-08-11Paper
Doubly iteratively reweighted algorithm for constrained compressed sensing models2023-06-07Paper
Error bounds, facial residual functions and applications to the exponential cone2023-05-25Paper
Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints2023-03-23Paper
Generalized power cones: optimal error bounds and automorphisms2022-11-29Paper
Kurdyka-Łojasiewicz exponent via inf-projection2022-08-05Paper
\(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm2022-03-15Paper
Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems2021-08-24Paper
Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization2021-06-28Paper
Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints2021-06-16Paper
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem2021-06-01Paper
A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints2021-01-26Paper
A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection2020-09-15Paper
A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set2020-05-20Paper
Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices2020-02-28Paper
Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems2020-01-20Paper
Polar Convolution2019-08-27Paper
A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems2019-06-26Paper
Iteratively reweighted \(\ell _1\) algorithms with extrapolation2019-06-13Paper
A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection2019-06-13Paper
A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems2018-12-19Paper
Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods2018-09-27Paper
A proximal difference-of-convex algorithm with extrapolation2018-04-20Paper
Peaceman-Rachford splitting for a class of nonconvex optimization problems2017-12-22Paper
Two-stage stochastic variational inequalities: an ERM-solution procedure2017-11-17Paper
Further properties of the forward-backward envelope with applications to difference-of-convex programming2017-07-18Paper
Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction2017-06-02Paper
Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems2017-01-31Paper
Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems2016-09-16Paper
Penalty Methods for a Class of Non-Lipschitz Optimization Problems2016-07-21Paper
Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem2016-02-23Paper
Global Convergence of Splitting Methods for Nonconvex Composite Optimization2015-12-11Paper
Gauge Optimization and Duality2015-04-08Paper
The generalized trust region subproblem2014-09-26Paper
Robust least square semidefinite programming with applications2014-09-26Paper
Computing Optimal Experimental Designs via Interior Point Method2014-04-30Paper
Hankel matrix rank minimization with applications to system identification and realization2013-12-13Paper
The proximal-proximal gradient algorithm2013-05-21Paper
An alternating direction method for finding Dantzig selectors2012-12-30Paper
Comparing SOS and SDP relaxations of sensor network localization2012-12-12Paper
Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints2012-12-12Paper
Minimizing Condition Number via Convex Programming2012-03-21Paper
(Robust) edge-based semidefinite programming relaxation of sensor network localization2011-12-14Paper
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning2011-03-21Paper
Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization2009-03-06Paper
The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces2008-05-22Paper
Optimal error bounds in the absence of constraint qualifications with applications to the $p$-cones and beyondN/APaper
Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problemsN/APaper
Kurdyka-\L ojasiewicz exponent via Hadamard parametrizationN/APaper
Tight error bounds for log-determinant cones without constraint qualificationsN/APaper
Subdifferentially polynomially bounded functions and Gaussian smoothing-based zeroth-order optimizationN/APaper

Research outcomes over time

This page was built for person: Ting Kei Pong