The following pages link to Defeng Sun (Q176701):
Displaying 27 items.
- Solvability of monotone tensor complementarity problems (Q2688135) (← links)
- Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems (Q2719234) (← links)
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization (Q2802143) (← links)
- An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming (Q2805705) (← links)
- A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization (Q2848177) (← links)
- Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints (Q2848997) (← links)
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization (Q2866219) (← links)
- A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block (Q2948891) (← links)
- Characterization of the Robust Isolated Calmness for a Class of Conic Programming Problems (Q2957977) (← links)
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem (Q3005390) (← links)
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming (Q3058503) (← links)
- Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm (Q3083318) (← links)
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras (Q3168974) (← links)
- (Q3175482) (← links)
- On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions (Q3192103) (← links)
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix (Q3435003) (← links)
- Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems (Q4340805) (← links)
- A Complete Characterization of the Robust Isolated Calmness of Nuclear Norm Regularized Convex Optimization Problems (Q4688184) (← links)
- A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition Based Proximal Admms for Convex Composite Programming (Q5127587) (← links)
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming (Q5219557) (← links)
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications (Q5388008) (← links)
- Semismooth Matrix-Valued Functions (Q5704068) (← links)
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems (Q5704113) (← links)
- On Degenerate Doubly Nonnegative Projection Problems (Q5868954) (← links)
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound (Q6051308) (← links)
- A metaheuristic algorithm for a locomotive routing problem arising in the steel industry (Q6167423) (← links)
- Convex and Nonconvex Risk-Based Linear Regression at Scale (Q6200158) (← links)
