scientific article; zbMATH DE number 7370526
From MaRDI portal
Publication:4998873
Kim-Chuan Toh, Defeng Sun, Yancheng Yuan
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1810.02677
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
conjugate gradient methodunsupervised learningaugmented Lagrangian methodsemismooth Newton methodconvex clustering
Related Items
Local Versions of Sum-of-Norms Clustering, Determine the number of clusters by data augmentation, Unnamed Item, Biconvex Clustering, Consistent Estimation of the Number of Communities via Regularized Network Embedding, A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering, Recovering Trees with Convex Clustering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Statistical properties of convex clustering
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- A nonsmooth version of Newton's method
- Relax, No Need to Round
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Optimization and nonsmooth analysis
- Eigenvalues of the Laplacian of a graph∗
- Monotone Operators and the Proximal Point Algorithm
- Semismooth and Semiconvex Functions in Constrained Optimization
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Clustering subgaussian mixtures by semidefinite programming
- Convex Clustering via l 1 Fusion Penalization
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Convex analysis and monotone operator theory in Hilbert spaces
