The following pages link to Defeng Sun (Q176701):
Displaying 50 items.
- (Q4998892) (← links)
- An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems (Q4999369) (← links)
- An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications (Q5003212) (← links)
- A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems (Q5116554) (← links)
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming (Q5124003) (← links)
- A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition Based Proximal Admms for Convex Composite Programming (Q5127587) (← links)
- (Q5149020) (← links)
- Best Nonnegative Rank-One Approximations of Tensors (Q5203971) (← links)
- (Q5210158) (← links)
- Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method (Q5214191) (← links)
- Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian (Q5217598) (← links)
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming (Q5219557) (← links)
- Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem (Q5231697) (← links)
- Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints (Q5254992) (← links)
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications (Q5388008) (← links)
- (Q5462175) (← links)
- Semismooth Matrix-Valued Functions (Q5704068) (← links)
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems (Q5704113) (← links)
- Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms (Q5863527) (← links)
- On Degenerate Doubly Nonnegative Projection Problems (Q5868954) (← links)
- A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering (Q5869815) (← links)
- QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems (Q5882949) (← links)
- Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications (Q5931897) (← links)
- Solving variational inequality problems via smoothing-nonsmooth reformulations (Q5936069) (← links)
- A further result on an implicit function theorem for locally Lipschitz functions (Q5945389) (← links)
- Alternative theorems for nonlinear projection equations and applications to generalized complementarity problems. (Q5953909) (← links)
- A primal-dual algorithm for minimizing a sum of Euclidean norms (Q5957946) (← links)
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions (Q5962721) (← links)
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems (Q5962724) (← 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)
- A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters (Q6306600) (← links)
- Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm (Q6307760) (← links)
- An Accelerated Proximal Alternating Direction Method of Multipliers for Optimal Decentralized Control of Uncertain Systems (Q6509761) (← links)
- An efficient sieving based secant method for sparse optimization problems with least-squares constraints (Q6512494) (← links)
- Low-rank quaternion tensor completion for color video inpainting via a novel factorization strategy (Q6527515) (← links)
- Unsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization (Q6527620) (← links)
- Accelerating preconditioned ADMM via degenerate proximal point mappings (Q6528010) (← links)
- An efficient sieving-based secant method for sparse optimization problems with least-squares constraints (Q6561379) (← links)
- A decomposition method for the group-based quay crane scheduling problem (Q6580542) (← links)
- Subgroup analysis in the heterogeneous Cox model (Q6627923) (← links)
- A highly efficient algorithm for solving exclusive lasso problems (Q6640992) (← links)
- Learning graph Laplacian with MCP (Q6640995) (← links)
- An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems (Q6661698) (← links)
- Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming (Q6733286) (← links)
- Implementable Semismooth* Newton Methods for Generalized Equations are G-Semismooth Newton Methods (Q6737190) (← links)
- HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problems (Q6738946) (← links)
- Characterizations of the Aubin Property of the Solution Mapping for Nonlinear Semidefinite Programming (Q6740607) (← links)
