A proximal point algorithm for sequential feature extraction applications
From MaRDI portal
Abstract: We propose a proximal point algorithm to solve LAROS problem, that is the problem of finding a "large approximately rank-one submatrix". This LAROS problem is used to sequentially extract features in data. We also develop a new stopping criterion for the proximal point algorithm, which is based on the duality conditions of eps-optimal solutions of the LAROS problem, with a theoretical guarantee. We test our algorithm with two image databases and show that we can use the LAROS problem to extract appropriate common features from these images.
Recommendations
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Common fixed points of an infinite family of nonexpansive mappings in uniformly convex metric spaces
- scientific article; zbMATH DE number 4133840
- A Projection Proximal-Point Algorithm for ℓ1Minimization
- A proximal point algorithm for minimax problems
Cited in
(3)
This page was built for publication: A proximal point algorithm for sequential feature extraction applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917147)