An Infeasible-Point Subgradient Method using Adaptive Approximate Projections

Details An Infeasible-Point Subgradient Method using Adaptive Approximate Projections An Infeasible-Point Subgradient Method using Adaptive Approximate Projections

2011-04-28

arxiv.org/abs/1104.5351v2

Mathematics

Optimization and Control

30 pages, 1 figure

Scientific paper

We propose a new subgradient method for the minimization of convex functions over a convex set. Common subgradient algorithms require an exact projection onto the feasible region in every iteration, which can be efficient only for problems that admit a fast projection. In our method we use inexact adaptive projections requiring to move within a certain distance of the exact projections (which decrease in the course of the algorithm). In particular, and in contrast to the usual projected subgradient schemes, the iterates in our method can be infeasible throughout the whole procedure and still we are able to provide conditions which ensure convergence to an optimal feasible point under suitable assumptions. Additionally, we briefly sketch two applications: finding the minimum l1-norm solution to an underdetermined linear system, an important problem in Compressed Sensing, and optimization with convex chance constraints.

Affiliated with

Also associated with

No associations

Rating

An Infeasible-Point Subgradient Method using Adaptive Approximate Projections 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 An Infeasible-Point Subgradient Method using Adaptive Approximate Projections, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Infeasible-Point Subgradient Method using Adaptive Approximate Projections will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-449510