Hypergraph-based convex semi-supervised unconstraint symmetric matrix factorization for image clustering
From MaRDI portal
(Redirected from Publication:6595309)
Recommendations
Cites work
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- A double parameter scaled BFGS method for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A survey of nonlinear conjugate gradient methods
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- Algorithm 851
- Analysis of a complex of statistical variables into principal components.
- Benchmarking optimization software with performance profiles.
- Conjugate Gradient Methods with Inexact Searches
- Correntropy based semi-supervised concept factorization with adaptive neighbors for clustering
- CUTE
- CUTEr and SifDec
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Elastic Net Hypergraph Learning for Image Clustering and Semi-Supervised Classification
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Learning the parts of objects by non-negative matrix factorization
- Nonlinear conjugate gradient methods for unconstrained optimization
- Nonnegative matrix factorization with mixed hypergraph regularization for community detection
- Numerical Optimization
- On the limited memory BFGS method for large scale optimization
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
This page was built for publication: Hypergraph-based convex semi-supervised unconstraint symmetric matrix factorization for image clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595309)