Defeng Sun

From MaRDI portal
Defeng Sun Q176701


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems
Journal of Optimization Theory and Applications
2025-01-13Paper
A highly efficient algorithm for solving exclusive lasso problems
Optimization Methods \& Software
2024-11-20Paper
Learning graph Laplacian with MCP
Optimization Methods \& Software
2024-11-20Paper
Subgroup analysis in the heterogeneous Cox model
Statistics in Medicine
2024-10-29Paper
A decomposition method for the group-based quay crane scheduling problem
INFORMS Journal on Computing
2024-07-29Paper
An efficient sieving-based secant method for sparse optimization problems with least-squares constraints
SIAM Journal on Optimization
2024-06-25Paper
Convex and Nonconvex Risk-Based Linear Regression at Scale
INFORMS Journal on Computing
2024-03-22Paper
Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
Computational Optimization and Applications
2023-10-19Paper
Quantifying low rank approximations of third order symmetric tensors
 
2023-07-20Paper
A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
European Journal of Operational Research
2023-07-10Paper
Adaptive sieving: A dimension reduction technique for sparse optimization problems
 
2023-06-29Paper
A Highly Efficient Algorithm for Solving Exclusive Lasso Problems
 
2023-06-25Paper
QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems
ACM Transactions on Mathematical Software
2023-03-29Paper
Solving polynomial variational inequality problems via Lagrange multiplier expressions and Moment-SOS relaxations
 
2023-03-21Paper
A squared smoothing Newton method for semidefinite programming
 
2023-03-10Paper
Solvability of monotone tensor complementarity problems
Science China. Mathematics
2023-03-09Paper
An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\varepsilon)$ Computational Complexity
 
2022-11-27Paper
A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
SIAM Journal on Optimization
2022-09-29Paper
On degenerate doubly nonnegative projection problems
Mathematics of Operations Research
2022-09-26Paper
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems
Mathematical Programming Computation
2022-06-16Paper
Robust tensor completion: equivalent surrogates, error bounds, and algorithms
SIAM Journal on Imaging Sciences
2022-06-01Paper
Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
Journal of Computational and Graphical Statistics
2022-03-28Paper
An inexact augmented Lagrangian method for second-order cone programming with applications
SIAM Journal on Optimization
2021-07-20Paper
scientific article; zbMATH DE number 7370538 (Why is no real title available?)
 
2021-07-09Paper
scientific article; zbMATH DE number 7370526 (Why is no real title available?)
 
2021-07-09Paper
An efficient linearly convergent regularized proximal point algorithm for fused multiple graphical Lasso problems
SIAM Journal on Mathematics of Data Science
2021-07-06Paper
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
European Journal of Operational Research
2021-06-04Paper
QPPAL: A two-phase proximal augmented Lagrangian method for high dimensional convex quadratic programming problems
 
2021-03-24Paper
scientific article; zbMATH DE number 7306909 (Why is no real title available?)
 
2021-02-05Paper
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
Mathematical Programming. Series A. Series B
2021-01-25Paper
A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
Mathematical Programming Computation
2021-01-25Paper
A unified algorithmic framework of symmetric Gauss-Seidel decomposition based proximal ADMMs for convex composite programming
Journal of Computational Mathematics
2020-10-27Paper
Adaptive Sieving with PPDNA: Generating Solution Paths of Exclusive Lasso Models
 
2020-09-18Paper
An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
SIAM Journal on Optimization
2020-09-17Paper
A proximal point dual Newton algorithm for solving group graphical Lasso problems
SIAM Journal on Optimization
2020-08-18Paper
Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
Mathematics of Operations Research
2020-03-12Paper
Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
SIAM Journal on Optimization
2020-02-25Paper
Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method
 
2020-02-07Paper
scientific article; zbMATH DE number 7156558 (Why is no real title available?)
 
2020-01-22Paper
An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
Mathematical Programming. Series A. Series B
2020-01-17Paper
On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
Mathematical Programming. Series A. Series B
2020-01-17Paper
Mesh Independence of a Majorized ABCD Method for Sparse PDE-constrained Optimization Problems
 
2020-01-03Paper
Best nonnegative rank-one approximations of tensors
SIAM Journal on Matrix Analysis and Applications
2019-12-09Paper
SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
Optimization Methods \& Software
2019-11-25Paper
Computing the best approximation over the intersection of a polyhedral set and the doubly nonnegative cone
SIAM Journal on Optimization
2019-11-08Paper
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
Mathematical Programming. Series A. Series B
2019-10-22Paper
Efficient sparse semismooth Newton methods for the clustered Lasso problem
SIAM Journal on Optimization
2019-08-27Paper
A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
Mathematical Programming. Series A. Series B
2019-05-17Paper
QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
Mathematical Programming Computation
2019-05-03Paper
A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems
 
2019-03-27Paper
A semi-proximal augmented Lagrangian based decomposition method for primal block angular convex composite quadratic conic programming problems
 
2018-12-12Paper
A Benders decomposition-based framework for solving quay crane scheduling problems
European Journal of Operational Research
2018-11-19Paper
A complete characterization of the robust isolated calmness of nuclear norm regularized convex optimization problems
Journal of Computational Mathematics
2018-10-22Paper
Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm
 
2018-10-04Paper
A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters
 
2018-09-12Paper
Sparse estimation of high-dimensional correlation matrices
Computational Statistics and Data Analysis
2018-08-15Paper
A decomposition approach for the minimum connected dominating set problem
 
2018-07-18Paper
On efficiently solving the subproblems of a level-set method for fused lasso problems
SIAM Journal on Optimization
2018-07-03Paper
Spectral operators of matrices
Mathematical Programming. Series A. Series B
2018-04-06Paper
Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
Journal of Computational and Graphical Statistics
2018-04-03Paper
A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
SIAM Journal on Optimization
2018-03-09Paper
A note on the convergence of ADMM for linearly constrained convex optimization problems
Computational Optimization and Applications
2017-03-07Paper
An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
Mathematical Programming. Series A. Series B
2017-02-03Paper
Characterization of the robust isolated calmness for a class of conic programming problems
SIAM Journal on Optimization
2017-01-31Paper
On the Asymptotic Superlinear Convergence of the Augmented Lagrangian Method for Semidefinite Programming with Multiple Solutions
 
2016-10-04Paper
A rank-corrected procedure for matrix completion with fixed basis coefficients
Mathematical Programming. Series A. Series B
2016-09-16Paper
On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
Journal of Optimization Theory and Applications
2016-07-01Paper
An efficient inexact ABCD method for least squares semidefinite programming
SIAM Journal on Optimization
2016-05-13Paper
A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
SIAM Journal on Optimization
2016-04-25Paper
A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
Mathematical Programming. Series A. Series B
2016-02-23Paper
A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
Mathematical Programming. Series A. Series B
2016-02-23Paper
A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block
 
2015-10-06Paper
SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
Mathematical Programming Computation
2015-09-30Paper
A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
Mathematical Programming Computation
2015-09-16Paper
A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
SIAM Journal on Optimization
2015-06-11Paper
First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
Mathematical Programming. Series A. Series B
2014-10-17Paper
On the Moreau-Yosida regularization of the vector \(k\)-norm related functions
SIAM Journal on Optimization
2014-09-26Paper
An introduction to a class of matrix cone programming
Mathematical Programming. Series A. Series B
2014-06-02Paper
Hankel matrix rank minimization with applications to system identification and realization
SIAM Journal on Matrix Analysis and Applications
2013-12-13Paper
A proximal point algorithm for log-determinant optimization with group Lasso regularization
SIAM Journal on Optimization
2013-09-25Paper
Solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
Discrete Geometry and Optimization
2013-09-13Paper
An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
SIAM Journal on Optimization
2013-01-04Paper
An implementable proximal point algorithmic framework for nuclear norm minimization
Mathematical Programming. Series A. Series B
2012-06-26Paper
An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
IMA Journal of Numerical Analysis
2011-06-07Paper
Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
Mathematics of Operations Research
2011-04-27Paper
Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
SIAM Journal on Optimization
2011-03-21Paper
A Newton-CG augmented Lagrangian method for semidefinite programming
SIAM Journal on Optimization
2010-12-03Paper
Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
SIAM Journal on Matrix Analysis and Applications
2010-08-19Paper
Correlation stress testing for value-at-risk: an unconstrained convex optimization approach
Computational Optimization and Applications
2010-03-19Paper
Erratum to ``On the coderivative of the projection operator onto the second-order cone
Set-Valued and Variational Analysis
2009-11-06Paper
On the coderivative of the projection operator onto the second-order cone
Set-Valued Analysis
2009-03-16Paper
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
SIAM Journal on Optimization
2009-03-06Paper
A Dual Optimization Approach to Inverse Quadratic Eigenvalue Problems with Partial Eigenstructure
SIAM Journal on Scientific Computing
2008-12-10Paper
The \(SC^1\) property of the squared norm of the SOC Fischer-Burmeister function
Operations Research Letters
2008-09-10Paper
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
Mathematical Programming. Series A. Series B
2008-06-04Paper
The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
Mathematics of Operations Research
2008-05-27Paper
A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
SIAM Journal on Matrix Analysis and Applications
2007-05-03Paper
A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
Computational Optimization and Applications
2006-11-17Paper
Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
Mathematical Programming. Series A. Series B
2005-12-14Paper
Semismooth Matrix-Valued Functions
Mathematics of Operations Research
2005-11-11Paper
Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
Mathematics of Operations Research
2005-11-11Paper
Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
Mathematical Programming. Series A. Series B
2005-08-08Paper
scientific article; zbMATH DE number 2190117 (Why is no real title available?)
 
2005-08-01Paper
A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
SIAM Journal on Optimization
2005-02-23Paper
Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
Mathematical Programming. Series A. Series B
2004-09-27Paper
Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms
Journal of Optimization Theory and Applications
2004-08-06Paper
Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
SIAM Journal on Optimization
2004-01-19Paper
Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems
SIAM Journal on Numerical Analysis
2004-01-18Paper
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Mathematical Programming. Series A. Series B
2003-07-13Paper
Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
Computational Optimization and Applications
2003-06-09Paper
scientific article; zbMATH DE number 1894378 (Why is no real title available?)
 
2003-04-08Paper
Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
Journal of Optimization Theory and Applications
2002-10-08Paper
A primal-dual algorithm for minimizing a sum of Euclidean norms
Journal of Computational and Applied Mathematics
2002-09-29Paper
Alternative theorems for nonlinear projection equations and applications to generalized complementarity problems.
Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods
2002-04-22Paper
A further result on an implicit function theorem for locally Lipschitz functions
Operations Research Letters
2001-10-10Paper
Solving variational inequality problems via smoothing-nonsmooth reformulations
Journal of Computational and Applied Mathematics
2001-07-02Paper
Second-order algorithms for generalized finite and semi-infinite min-max problems
SIAM Journal on Optimization
2001-06-21Paper
scientific article; zbMATH DE number 1552028 (Why is no real title available?)
 
2001-06-21Paper
Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications
Acta Mathematicae Applicatae Sinica. English Series
2001-05-06Paper
scientific article; zbMATH DE number 1421091 (Why is no real title available?)
 
2001-03-29Paper
scientific article; zbMATH DE number 1559033 (Why is no real title available?)
 
2001-01-31Paper
Convergence Properties of Nonlinear Conjugate Gradient Methods
SIAM Journal on Optimization
2000-11-20Paper
scientific article; zbMATH DE number 1329062 (Why is no real title available?)
 
2000-11-08Paper
Properties of the Moreau-Yosida regularization of a piecewise \(C^2\) convex function
Mathematical Programming. Series A. Series B
2000-07-21Paper
A regularization Newton method for solving nonlinear complementarity problems
Applied Mathematics and Optimization
2000-06-14Paper
scientific article; zbMATH DE number 1306988 (Why is no real title available?)
 
2000-01-13Paper
A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
Mathematical Programming. Series A. Series B
2000-01-01Paper
A New Unconstrained Differentiable Merit Function for Box Constrained Variational Inequality Problems and a Damped Gauss--Newton Method
SIAM Journal on Optimization
1999-11-24Paper
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Mathematics of Computation
1999-11-01Paper
Secant methods for semismooth equations
Numerische Mathematik
1999-06-07Paper
On NCP-functions
Computational Optimization and Applications
1999-01-01Paper
First-order algorithms for generalized semi-infinite min-max problems
Computational Optimization and Applications
1999-01-01Paper
On a conjecture in Moreau-Yosida approximation of a nonsmooth convex function
Chinese Science Bulletin
1998-10-01Paper
scientific article; zbMATH DE number 1186891 (Why is no real title available?)
 
1998-08-10Paper
Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
SIAM Journal on Optimization
1998-05-12Paper
A Trust Region Method for Solving Generalized Complementarity Problems
SIAM Journal on Optimization
1998-05-12Paper
scientific article; zbMATH DE number 1131717 (Why is no real title available?)
 
1998-05-12Paper
scientific article; zbMATH DE number 1131792 (Why is no real title available?)
 
1998-05-06Paper
scientific article; zbMATH DE number 1043086 (Why is no real title available?)
 
1998-01-08Paper
Newton and quasi-Newton methods for normal maps with polyhedral sets
Journal of Optimization Theory and Applications
1997-10-07Paper
A computable generalized Hessian of the D-gap function and Newton-type methods for variational inequality problems
 
1997-09-10Paper
A class of iterative methods for solving nonlinear projection equations
Journal of Optimization Theory and Applications
1997-07-06Paper
Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
SIAM Journal on Optimization
1997-06-12Paper
scientific article; zbMATH DE number 980261 (Why is no real title available?)
 
1997-02-19Paper
scientific article; zbMATH DE number 883264 (Why is no real title available?)
 
1996-07-08Paper
scientific article; zbMATH DE number 847094 (Why is no real title available?)
 
1996-03-12Paper
scientific article; zbMATH DE number 810446 (Why is no real title available?)
 
1995-11-26Paper
scientific article; zbMATH DE number 640481 (Why is no real title available?)
 
1995-08-13Paper
An Accelerated Proximal Alternating Direction Method of Multipliers for Optimal Decentralized Control of Uncertain Systems
 
N/APaper
An efficient sieving based secant method for sparse optimization problems with least-squares constraints
 
N/APaper
Low-rank quaternion tensor completion for color video inpainting via a novel factorization strategy
 
N/APaper
Unsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization
 
N/APaper
Accelerating preconditioned ADMM via degenerate proximal point mappings
 
N/APaper


Research outcomes over time


This page was built for person: Defeng Sun