default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDefeng Sun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j98]Defeng Sun
, Lixin Tang, Roberto Baldacci, Zihan Chen:
A Decomposition Method for the Group-Based Quay Crane Scheduling Problem. INFORMS J. Comput. 36(2): 543-570 (2024)- [j97]Qian Li, Defeng Sun, Yancheng Yuan:
An Efficient Sieving-Based Secant Method for Sparse Optimization Problems with Least-Squares Constraints. SIAM J. Optim. 34(2): 2038-2066 (2024) - [i10]Xijun Li, Fangzhou Zhu, Hui-Ling Zhen, Weilin Luo, Meng Lu, Yimin Huang, Zhenan Fan, Zirui Zhou, Yufei Kuang, Zhihai Wang, Zijie Geng, Yang Li, Haoyang Liu, Zhiwu An, Muming Yang, Jianshu Li, Jie Wang, Junchi Yan, Defeng Sun, Tao Zhong, Yong Zhang, Jia Zeng, Mingxuan Yuan, Jianye Hao, Jun Yao, Kun Mao:
Machine Learning Insides OptVerse AI Solver: Design Principles and Applications. CoRR abs/2401.05960 (2024) - [i9]Maojun Sun, Ruijian Han, Binyan Jiang, Houduo Qi, Defeng Sun, Yancheng Yuan, Jian Huang:
LAMBDA: A Large Model Based Data Agent. CoRR abs/2407.17535 (2024) - 2023
- [j96]Dongdong Zhang, Shaohua Pan, Shujun Bi, Defeng Sun:
Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound. Comput. Optim. Appl. 86(2): 627-667 (2023) - [j95]Baobin Huang, Lixin Tang, Roberto Baldacci, Gongshu Wang, Defeng Sun:
A metaheuristic algorithm for a locomotive routing problem arising in the steel industry. Eur. J. Oper. Res. 308(1): 385-399 (2023) - [j94]Can Wu, Ying Cui, Donghui Li, Defeng Sun:
Convex and Nonconvex Risk-Based Linear Regression at Scale. INFORMS J. Comput. 35(4): 797-816 (2023) - [j93]Qian Li, Binyan Jiang, Defeng Sun:
MARS: A Second-Order Reduction Algorithm for High-Dimensional Sparse Precision Matrices Estimation. J. Mach. Learn. Res. 24: 134:1-134:44 (2023) - [j92]Ying Meng, Fengyuan Shi, Lixin Tang, Defeng Sun:
Improvement of Reinforcement Learning With Supermodularity. IEEE Trans. Neural Networks Learn. Syst. 34(9): 5298-5309 (2023) - [c5]Shuai Wang, Yanqing Xu, Zhiguo Wang, Tsung-Hui Chang, Tony Q. S. Quek, Defeng Sun:
Beyond ADMM: A Unified Client-Variance-Reduced Adaptive Federated Learning Framework. AAAI 2023: 10175-10183 - [i8]Ziwen Wang, Yancheng Yuan, Jiaming Ma, Tieyong Zeng, Defeng Sun:
Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees. CoRR abs/2303.16841 (2023) - 2022
- [j91]Peixin Ge, Ren Zhao, Defeng Sun, Yun Dong:
Integrated optimisation of storage and pre-marshalling moves in a slab warehouse. Int. J. Prod. Res. 60(6): 2021-2043 (2022) - [j90]Ying Cui, Ling Liang, Defeng Sun, Kim-Chuan Toh:
On Degenerate Doubly Nonnegative Projection Problems. Math. Oper. Res. 47(3): 2219-2239 (2022) - [j89]Meixia Lin, Defeng Sun, Kim-Chuan Toh:
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems. Math. Program. Comput. 14(2): 223-270 (2022) - [j88]Xueying Zhao, Minru Bai, Defeng Sun, Libin Zheng:
Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms. SIAM J. Imaging Sci. 15(2): 625-669 (2022) - [j87]Yancheng Yuan, Tsung-Hui Chang, Defeng Sun, Kim-Chuan Toh:
A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering. SIAM J. Optim. 32(3): 2294-2318 (2022) - [j86]Ling Liang, Xudong Li, Defeng Sun, Kim-Chuan Toh:
QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems. ACM Trans. Math. Softw. 48(3): 33:1-33:27 (2022) - [i7]Shuai Wang, Yanqing Xu, Zhiguo Wang, Tsung-Hui Chang, Tony Q. S. Quek, Defeng Sun:
Beyond ADMM: A Unified Client-variance-reduced Adaptive Federated Learning Framework. CoRR abs/2212.01519 (2022) - 2021
- [j85]Defeng Sun, Lixin Tang, Roberto Baldacci, Andrew Lim:
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability. Eur. J. Oper. Res. 291(1): 271-283 (2021) - [j84]Xin Yee Lam, Defeng Sun, Kim-Chuan Toh:
Semi-proximal Augmented Lagrangian-Based Decomposition Methods for Primal Block-Angular Convex Composite Quadratic Conic Programming Problems. INFORMS J. Optim. 3(3): 254-277 (2021) - [j83]Zhen Gao, Defeng Sun, Ren Zhao, Yun Dong:
Ship-unloading scheduling optimization for a steel plant. Inf. Sci. 544: 214-226 (2021) - [j82]Defeng Sun, Kim-Chuan Toh, Yancheng Yuan:
Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm. J. Mach. Learn. Res. 22: 9:1-9:32 (2021) - [j81]Lei Yang, Jia Li, Defeng Sun, Kim-Chuan Toh:
A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters. J. Mach. Learn. Res. 22: 21:1-21:37 (2021) - [j80]Liang Chen, Xudong Li, Defeng Sun, Kim-Chuan Toh:
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming. Math. Program. 185(1-2): 111-161 (2021) - [j79]Ling Liang, Defeng Sun, Kim-Chuan Toh:
An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications. SIAM J. Optim. 31(3): 1748-1773 (2021) - [j78]Ning Zhang, Yangjing Zhang, Defeng Sun, Kim-Chuan Toh:
An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems. SIAM J. Math. Data Sci. 3(2): 524-543 (2021) - 2020
- [j77]Zheng-Hai Huang, Defeng Sun, Jie Sun:
Preface. Asia Pac. J. Oper. Res. 37(4): 2002001:1-2002001:2 (2020) - [j76]Yangjing Zhang, Ning Zhang, Defeng Sun, Kim-Chuan Toh:
An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems. Math. Program. 179(1): 223-263 (2020) - [j75]Xudong Li, Defeng Sun, Kim-Chuan Toh:
On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope. Math. Program. 179(1): 419-446 (2020) - [j74]Shujun Bi, Shaohua Pan, Defeng Sun:
A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery. Math. Program. Comput. 12(4): 569-602 (2020) - [j73]Defeng Sun, Kim-Chuan Toh, Yancheng Yuan, Xin-Yuan Zhao:
SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0). Optim. Methods Softw. 35(1): 87-115 (2020) - [j72]Chao Ding, Defeng Sun, Jie Sun, Kim-Chuan Toh:
Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian. SIAM J. Optim. 30(1): 630-659 (2020) - [j71]Yangjing Zhang, Ning Zhang, Defeng Sun, Kim-Chuan Toh:
A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems. SIAM J. Optim. 30(3): 2197-2220 (2020) - [j70]Xudong Li, Defeng Sun, Kim-Chuan Toh:
An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming. SIAM J. Optim. 30(3): 2410-2440 (2020) - [i6]Yangjing Zhang, Kim-Chuan Toh, Defeng Sun:
Learning Graph Laplacian with MCP. CoRR abs/2010.11559 (2020)
2010 – 2019
- 2019
- [j69]Defeng Sun, Lixin Tang, Roberto Baldacci:
A Benders decomposition-based framework for solving quay crane scheduling problems. Eur. J. Oper. Res. 273(2): 504-515 (2019) - [j68]Ziyan Luo, Defeng Sun, Kim-Chuan Toh, Naihua Xiu:
Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method. J. Mach. Learn. Res. 20: 106:1-106:25 (2019) - [j67]Xudong Li, Defeng Sun, Kim-Chuan Toh:
A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications. Math. Program. 175(1-2): 395-418 (2019) - [j66]Ying Cui, Defeng Sun, Kim-Chuan Toh:
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming. Math. Program. 178(1-2): 381-415 (2019) - [j65]Meixia Lin, Yong-Jin Liu, Defeng Sun, Kim-Chuan Toh:
Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem. SIAM J. Optim. 29(3): 2026-2052 (2019) - [j64]Ying Cui, Defeng Sun, Kim-Chuan Toh:
Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone. SIAM J. Optim. 29(4): 2785-2813 (2019) - [j63]Shenglong Hu, Defeng Sun, Kim-Chuan Toh:
Best Nonnegative Rank-One Approximations of Tensors. SIAM J. Matrix Anal. Appl. 40(4): 1527-1554 (2019) - [i5]Yancheng Yuan, Meixia Lin, Defeng Sun, Kim-Chuan Toh:
On the Closed-form Proximal Mapping and Efficient Algorithms for Exclusive Lasso Models. CoRR abs/1902.00151 (2019) - [i4]Peipei Tang, Chengjing Wang, Defeng Sun, Kim-Chuan Toh:
A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems. CoRR abs/1903.11460 (2019) - 2018
- [j62]Deren Han, Defeng Sun, Liwei Zhang:
Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming. Math. Oper. Res. 43(2): 622-637 (2018) - [j61]Chao Ding, Defeng Sun, Jie Sun, Kim-Chuan Toh:
Spectral operators of matrices. Math. Program. 168(1-2): 509-531 (2018) - [j60]Xudong Li, Defeng Sun, Kim-Chuan Toh:
QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming. Math. Program. Comput. 10(4): 703-743 (2018) - [j59]Xudong Li, Defeng Sun, Kim-Chuan Toh:
A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems. SIAM J. Optim. 28(1): 433-458 (2018) - [j58]Xudong Li, Defeng Sun, Kim-Chuan Toh:
On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems. SIAM J. Optim. 28(2): 1842-1866 (2018) - [c4]Yancheng Yuan, Defeng Sun, Kim-Chuan Toh:
An Efficient Semismooth Newton Based Algorithm for Convex Clustering. ICML 2018: 5704-5712 - [i3]Yancheng Yuan, Defeng Sun, Kim-Chuan Toh:
An Efficient Semismooth Newton Based Algorithm for Convex Clustering. CoRR abs/1802.07091 (2018) - [i2]Defeng Sun, Kim-Chuan Toh, Yancheng Yuan:
Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm. CoRR abs/1810.02677 (2018) - 2017
- [j57]Liang Chen, Defeng Sun, Kim-Chuan Toh:
A note on the convergence of ADMM for linearly constrained convex optimization problems. Comput. Optim. Appl. 66(2): 327-343 (2017) - [j56]Liang Chen, Defeng Sun, Kim-Chuan Toh:
An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming. Math. Program. 161(1-2): 237-270 (2017) - [j55]Chao Ding, Defeng Sun, Liwei Zhang:
Characterization of the Robust Isolated Calmness for a Class of Conic Programming Problems. SIAM J. Optim. 27(1): 67-90 (2017) - 2016
- [j54]Ying Cui, Chenlei Leng, Defeng Sun:
Sparse estimation of high-dimensional correlation matrices. Comput. Stat. Data Anal. 93: 390-403 (2016) - [j53]Ying Cui, Xudong Li, Defeng Sun, Kim-Chuan Toh:
On the Convergence Properties of a Majorized Alternating Direction Method of Multipliers for Linearly Constrained Convex Optimization Problems with Coupled Objective Functions. J. Optim. Theory Appl. 169(3): 1013-1041 (2016) - [j52]Xudong Li, Defeng Sun, Kim-Chuan Toh:
A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions. Math. Program. 155(1-2): 333-373 (2016) - [j51]Caihua Chen, Yong-Jin Liu, Defeng Sun, Kim-Chuan Toh:
A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems. Math. Program. 155(1-2): 435-470 (2016) - [j50]Weimin Miao, Shaohua Pan, Defeng Sun:
A rank-corrected procedure for matrix completion with fixed basis coefficients. Math. Program. 159(1-2): 289-338 (2016) - [j49]Min Li, Defeng Sun, Kim-Chuan Toh:
A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization. SIAM J. Optim. 26(2): 922-950 (2016) - [j48]Defeng Sun, Kim-Chuan Toh, Liuqin Yang:
An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming. SIAM J. Optim. 26(2): 1072-1100 (2016) - 2015
- [j47]Min Li, Defeng Sun, Kim-Chuan Toh:
A Convergent 3-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block. Asia Pac. J. Oper. Res. 32(4): 1550024:1-1550024:19 (2015) - [j46]Liuqin Yang, Defeng Sun, Kim-Chuan Toh:
SDPNAL \(+\) : a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. 7(3): 331-366 (2015) - [j45]Defeng Sun, Kim-Chuan Toh, Liuqin Yang:
A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints. SIAM J. Optim. 25(2): 882-915 (2015) - [c3]Defeng Sun, Bin Dai, Chuanxiang Li, Liang Xiao:
Color name TLD1. ICIA 2015: 791-796 - 2014
- [j44]Chao Ding, Defeng Sun, Kim-Chuan Toh:
An introduction to a class of matrix cone programming. Math. Program. 144(1-2): 141-179 (2014) - [j43]Chao Ding, Defeng Sun, Jane J. Ye:
First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints. Math. Program. 147(1-2): 539-579 (2014) - [j42]Kaifeng Jiang, Defeng Sun, Kim-Chuan Toh:
A partial proximal point algorithm for nuclear norm regularized matrix least squares problems. Math. Program. Comput. 6(3): 281-325 (2014) - [j41]Bin Wu, Chao Ding, Defeng Sun, Kim-Chuan Toh:
On the Moreau-Yosida Regularization of the Vector k-Norm Related Functions. SIAM J. Optim. 24(2): 766-794 (2014) - [c2]Zhuoqi Cheng, Shaohui Foong, Defeng Sun, U-Xuan Tan:
Algorithm for design of compliant mechanisms for torsional applications. AIM 2014: 628-633 - 2013
- [j40]Junfeng Yang, Defeng Sun, Kim-Chuan Toh:
A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization. SIAM J. Optim. 23(2): 857-893 (2013) - [j39]Maryam Fazel, Ting Kei Pong, Defeng Sun, Paul Tseng:
Hankel Matrix Rank Minimization with Applications to System Identification and Realization. SIAM J. Matrix Anal. Appl. 34(3): 946-977 (2013) - [c1]Defeng Sun, Lixin Tang:
Benders approach for the raw material transportation scheduling problem in steel industry. ICCA 2013: 481-484 - 2012
- [j38]Yong-Jin Liu, Defeng Sun, Kim-Chuan Toh:
An implementable proximal point algorithmic framework for nuclear norm minimization. Math. Program. 133(1-2): 399-436 (2012) - [j37]Kaifeng Jiang, Defeng Sun, Kim-Chuan Toh:
An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP. SIAM J. Optim. 22(3): 1042-1064 (2012) - [i1]Weimin Miao, Shaohua Pan, Defeng Sun:
A Rank-Corrected Procedure for Matrix Completion with Fixed Basis Coefficients. CoRR abs/1210.3709 (2012) - 2010
- [j36]Houduo Qi, Defeng Sun:
Correlation stress testing for value-at-risk: an unconstrained convex optimization approach. Comput. Optim. Appl. 45(2): 427-462 (2010) - [j35]Xin-Yuan Zhao, Defeng Sun, Kim-Chuan Toh:
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming. SIAM J. Optim. 20(4): 1737-1765 (2010) - [j34]Chengjing Wang, Defeng Sun, Kim-Chuan Toh:
Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm. SIAM J. Optim. 20(6): 2994-3013 (2010)
2000 – 2009
- 2009
- [j33]Yan Gao, Defeng Sun:
Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints. SIAM J. Matrix Anal. Appl. 31(3): 1432-1457 (2009) - [r1]Liqun Qi, Defeng Sun:
Nonsmooth and Smoothing Methods for Nonlinear Complementarity Problems and Variational Inequalities. Encyclopedia of Optimization 2009: 2671-2675 - 2008
- [j32]Defeng Sun, Jie Sun:
Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras. Math. Oper. Res. 33(2): 421-445 (2008) - [j31]Defeng Sun, Jie Sun, Liwei Zhang:
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming. Math. Program. 114(2): 349-391 (2008) - [j30]Jein-Shan Chen, Defeng Sun, Jie Sun:
The SC1 property of the squared norm of the SOC Fischer-Burmeister function. Oper. Res. Lett. 36(3): 385-392 (2008) - [j29]Zi Xian Chan, Defeng Sun:
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming. SIAM J. Optim. 19(1): 370-396 (2008) - 2007
- [j28]Zheng-Jian Bai, Delin Chu, Defeng Sun:
A Dual Optimization Approach to Inverse Quadratic Eigenvalue Problems with Partial Eigenstructure. SIAM J. Sci. Comput. 29(6): 2531-2561 (2007) - 2006
- [j27]Zheng-Hai Huang, Defeng Sun, Gongyun Zhao:
A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming. Comput. Optim. Appl. 35(2): 199-237 (2006) - [j26]Defeng Sun:
The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications. Math. Oper. Res. 31(4): 761-776 (2006) - [j25]Houduo Qi, Defeng Sun:
A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix. SIAM J. Matrix Anal. Appl. 28(2): 360-385 (2006) - 2005
- [j24]Defeng Sun, Jie Sun:
Strong Semismoothness of the Fischer-Burmeister SDC and SOC Complementarity Functions. Math. Program. 103(3): 575-581 (2005) - [j23]Fanwen Meng, Defeng Sun, Gongyun Zhao:
Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization. Math. Program. 104(2-3): 561-581 (2005) - 2004
- [j22]Zheng-Hai Huang, Liqun Qi, Defeng Sun:
Sub-quadratic convergence of a smoothing Newton algorithm for the P 0- and monotone LCP. Math. Program. 99(3): 423-441 (2004) - [j21]Jie Sun, Defeng Sun, Liqun Qi:
A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems. SIAM J. Optim. 14(3): 783-806 (2004) - 2003
- [j20]Xiongda Chen, Defeng Sun, Jie Sun:
Complementarity Functions and Numerical Experiments on Some Smoothing Newton Methods for Second-Order-Cone Complementarity Problems. Comput. Optim. Appl. 25(1-3): 39-56 (2003) - [j19]Jong-Shi Pang, Defeng Sun, Jie Sun:
Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems. Math. Oper. Res. 28(1): 39-63 (2003) - [j18]Houduo Qi, Liqun Qi, Defeng Sun:
Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods. SIAM J. Optim. 14(2): 439-463 (2003) - 2002
- [j17]Defeng Sun, Jie Sun:
Semismooth Matrix-Valued Functions. Math. Oper. Res. 27(1): 150-169 (2002) - [j16]Defeng Sun, Robert S. Womersley, Houduo Qi:
A feasible semismooth asymptotically Newton method for mixed complementarity problems. Math. Program. 94(1): 167-187 (2002) - [j15]Defeng Sun, Jie Sun:
Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems. SIAM J. Numer. Anal. 40(6): 2352-2367 (2002) - 2001
- [j14]Defeng Sun:
A further result on an implicit function theorem for locally Lipschitz functions. Oper. Res. Lett. 28(4): 193-198 (2001) - [j13]Elijah Polak, Liqun Qi, Defeng Sun:
Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems. SIAM J. Optim. 11(4): 937-961 (2001) - 2000
- [j12]Liqun Qi, Defeng Sun:
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems. Math. Comput. 69(229): 283-304 (2000) - [j11]Liqun Qi, Defeng Sun, Guanglu Zhou:
A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. Math. Program. 87(1): 1-35 (2000) - [j10]Yu-Hong Dai, Jiye Han, Guanghui Liu, Defeng Sun, Hongxia Yin, Ya-Xiang Yuan:
Convergence Properties of Nonlinear Conjugate Gradient Methods. SIAM J. Optim. 10(2): 345-358 (2000)
1990 – 1999
- 1999
- [j9]Elijah Polak, Liqun Qi, Defeng Sun:
First-Order Algorithms for Generalized Semi-Infinite Min-Max Problems. Comput. Optim. Appl. 13(1-3): 137-161 (1999) - [j8]Defeng Sun, Liqun Qi:
On NCP-Functions. Comput. Optim. Appl. 13(1-3): 201-220 (1999) - [j7]Robert Mifflin, Liqun Qi, Defeng Sun:
Properties of the Moreau-Yosida regularization of a piecewise C2 convex function. Math. Program. 84(2): 269-281 (1999) - [j6]Defeng Sun, Robert S. Womersley:
A New Unconstrained Differentiable Merit Function for Box Constrained Variational Inequality Problems and a Damped Gauss-Newton Method. SIAM J. Optim. 9(2): 388-413 (1999) - 1998
- [j5]Xiaojun Chen, Liqun Qi, Defeng Sun:
Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities. Math. Comput. 67(222): 519-540 (1998) - [j4]Florian A. Potra, Liqun Qi, Defeng Sun:
Secant methods for semismooth equations. Numerische Mathematik 80(2): 305-324 (1998) - [j3]Houyuan Jiang, Masao Fukushima, Liqun Qi, Defeng Sun:
A Trust Region Method for Solving Generalized Complementarity Problems. SIAM J. Optim. 8(1): 140-157 (1998) - [j2]Robert Mifflin, Defeng Sun, Liqun Qi:
Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization. SIAM J. Optim. 8(2): 583-603 (1998) - 1997
- [j1]Defeng Sun, Jiye Han:
Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems. SIAM J. Optim. 7(2): 463-480 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
