The following pages link to Ting Kei Pong (Q248011):
Displaying 50 items.
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) (← links)
- The generalized trust region subproblem (Q457202) (← links)
- Robust least square semidefinite programming with applications (Q457207) (← links)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286) (← links)
- Comparing SOS and SDP relaxations of sensor network localization (Q694515) (← links)
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints (Q694528) (← links)
- Two-stage stochastic variational inequalities: an ERM-solution procedure (Q1680962) (← links)
- Peaceman-Rachford splitting for a class of nonconvex optimization problems (Q1687318) (← links)
- A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods (Q1785009) (← links)
- An alternating direction method for finding Dantzig selectors (Q1927184) (← links)
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem (Q2028477) (← links)
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm (Q2114814) (← links)
- Kurdyka-Łojasiewicz exponent via inf-projection (Q2162122) (← links)
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection (Q2200085) (← links)
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196) (← links)
- Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← links)
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems (Q2425176) (← links)
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization (Q2866219) (← links)
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems (Q2957980) (← links)
- Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning (Q3083339) (← links)
- Minimizing Condition Number via Convex Programming (Q3225534) (← links)
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization (Q3457189) (← links)
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces (Q3503212) (← links)
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization (Q3608976) (← links)
- A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems (Q4562251) (← links)
- Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization (Q4997175) (← links)
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) (← links)
- A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set (Q5110557) (← links)
- A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints (Q5146698) (← links)
- Polar Convolution (Q5231669) (← links)
- Gauge Optimization and Duality (Q5245375) (← links)
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction (Q5266366) (← links)
- Computing Optimal Experimental Designs via Interior Point Method (Q5413661) (← links)
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems (Q5741071) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)
- Error bounds, facial residual functions and applications to the exponential cone (Q6044980) (← links)
- Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints (Q6051303) (← links)
- Doubly iteratively reweighted algorithm for constrained compressed sensing models (Q6097766) (← links)
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
- Convergence Rate Analysis of a Dykstra-Type Projection Algorithm (Q6202756) (← links)
- Optimal error bounds in the absence of constraint qualifications with applications to the $p$-cones and beyond (Q6505188) (← links)
- Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems (Q6507689) (← links)
- Kurdyka-\L ojasiewicz exponent via Hadamard parametrization (Q6519859) (← links)
- Tight error bounds for log-determinant cones without constraint qualifications (Q6525671) (← links)
- Subdifferentially polynomially bounded functions and Gaussian smoothing-based zeroth-order optimization (Q6533621) (← links)
- Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems (Q6634538) (← links)
