The following pages link to Defeng Sun (Q176701):
Displaying 50 items.
- Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination (Q126401) (← links)
- (Q226087) (redirect page) (← links)
- On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions (Q301734) (← links)
- (Q312677) (redirect page) (← links)
- A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678) (← links)
- (Q431023) (redirect page) (← links)
- An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints (Q463746) (← links)
- (Q495941) (redirect page) (← links)
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming (Q507319) (← links)
- A note on the convergence of ADMM for linearly constrained convex optimization problems (Q513720) (← links)
- (Q587637) (redirect page) (← links)
- Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms (Q597176) (← links)
- (Q700707) (redirect page) (← links)
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems (Q700708) (← links)
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming (Q927160) (← links)
- The \(SC^1\) property of the squared norm of the SOC Fischer-Burmeister function (Q943805) (← links)
- On the coderivative of the projection operator onto the second-order cone (Q1005151) (← links)
- Erratum to ``On the coderivative of the projection operator onto the second-order cone'' (Q1034816) (← links)
- Secant methods for semismooth equations (Q1266319) (← links)
- First-order algorithms for generalized semi-infinite min-max problems (Q1294822) (← links)
- On NCP-functions (Q1294826) (← links)
- A class of iterative methods for solving nonlinear projection equations (Q1359468) (← links)
- Newton and quasi-Newton methods for normal maps with polyhedral sets (Q1369048) (← links)
- On a conjecture in Moreau-Yosida approximation of a nonsmooth convex function (Q1375821) (← links)
- A feasible semismooth asymptotically Newton method for mixed complementarity problems (Q1396819) (← links)
- Properties of the Moreau-Yosida regularization of a piecewise \(C^2\) convex function (Q1572676) (← links)
- A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
- Sparse estimation of high-dimensional correlation matrices (Q1660228) (← links)
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming (Q1741120) (← links)
- A regularization Newton method for solving nonlinear complementarity problems (Q1808698) (← links)
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems (Q1810968) (← links)
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP (Q1881042) (← links)
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities (Q1970293) (← links)
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
- An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems (Q2146447) (← links)
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery (Q2220914) (← links)
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems (Q2288192) (← links)
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope (Q2288199) (← links)
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming (Q2330654) (← links)
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach (Q2379691) (← links)
- Spectral operators of matrices (Q2413097) (← links)
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications (Q2414911) (← links)
- An introduction to a class of matrix cone programming (Q2452376) (← links)
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions (Q2487853) (← links)
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization (Q2576736) (← links)
