Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms

Details Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms

2012-03-20

arxiv.org/abs/1203.4580v1

Computer Science

Information Theory

submitted to SIAM Optimization

Scientific paper

This paper treats the problem of minimizing a general continuously differentiable function subject to sparsity constraints. We present and analyze several different optimality criteria which are based on the notions of stationarity and coordinate-wise optimality. These conditions are then used to derive three numerical algorithms aimed at finding points satisfying the resulting optimality criteria: the iterative hard thresholding method and the greedy and partial sparse-simplex methods. The first algorithm is essentially a gradient projection method while the remaining two algorithms are of coordinate descent type. The theoretical convergence of these methods and their relations to the derived optimality conditions are studied. The algorithms and results are illustrated by several numerical examples.

Affiliated with

Also associated with

No associations

Rating

Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms 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 Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-487480