Search

Your search keyword '"Sun, Defeng"' showing total 490 results

Search Constraints

Start Over You searched for: Author "Sun, Defeng" Remove constraint Author: "Sun, Defeng"
490 results on '"Sun, Defeng"'

Search Results

51. Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian

52. Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm

53. A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters

54. Efficient sparse semismooth Newton methods for the clustered lasso problem

55. On the Equivalence of Inexact Proximal ALM and ADMM for a Class of Convex Composite Programming

56. Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method

57. Computing the Best Approximation Over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone

58. An Efficient Semismooth Newton Based Algorithm for Convex Clustering

60. An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems

61. Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone

62. SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)

63. On the R-superlinear convergence of the KKT residues generated by the augmented Lagrangian method for convex composite conic programming

64. On efficiently solving the subproblems of a level-set method for fused lasso problems

65. A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications

66. A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery

67. A complete characterization on the robust isolated calmness of the nuclear norm regularized convex optimization problems

68. On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope

69. Research on Shortest Path Planning and Smoothing Without Obstacle Collision Based on Moving Carrier.

72. On the Asymptotic Superlinear Convergence of the Augmented Lagrangian Method for Semidefinite Programming with Multiple Solutions

73. A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems

74. Fast algorithms for large scale generalized distance weighted discrimination

75. Characterization of the Robust Isolated Calmness for a Class of Conic Programming Problems

76. QSDPNAL: A two-phase augmented Lagrangian method for convex quadratic semidefinite programming

80. Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Quadratic and Semi-Definite Programming

81. A Note on the Convergence of ADMM for Linearly Constrained Convex Optimization Problems

82. An Efficient Inexact Symmetric Gauss-Seidel Based Majorized ADMM for High-Dimensional Convex Composite Conic Programming

83. An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming

84. On the convergence properties of a majorized ADMM for linearly constrained convex optimization problems with coupled objective functions

85. A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization

86. Research progress on stellate ganglion block improving postoperative cognitive dysfunction.

89. A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block

92. A Schur Complement Based Semi-Proximal ADMM for Convex Quadratic Conic Programming and Extensions

93. SDPNAL$+$: A Majorized Semismooth Newton-CG Augmented Lagrangian Method for Semidefinite Programming with Nonnegative Constraints

94. A Convergent 3-Block Semi-Proximal Alternating Direction Method of Multipliers for Conic Programming with $4$-Type of Constraints

95. Spectral Operators of Matrices

Catalog

Books, media, physical & digital resources