Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint

Details Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint

2011-07-06

arxiv.org/abs/1107.1163v1

Mathematics

Optimization and Control

Scientific paper

The sparsity constrained rank-one matrix approximation problem is a difficult mathematical optimization problem which arises in a wide array of useful applications in engineering, machine learning and statistics, and the design of algorithms for this problem has attracted intensive research activities. We introduce an algorithmic framework, called ConGradU, that unifies a variety of seemingly different algorithms that have been derived from disparate approaches, and allows for deriving new schemes. Building on the old and well-known conditional gradient algorithm, ConGradU is a simplified version with unit step size and yields a generic algorithm which either is given by an analytic formula or requires a very low computational complexity. Mathematical properties are systematically developed and numerical experiments are given.

Affiliated with

Also associated with

No associations

Rating

Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678660