Summary and Info
For solving nonsmooth convex constrained optimization problems, we propose an algorithm which combines the ideas of the proximal bundle methods with the filter strategy for evaluating candidate points. The resulting algorithm inherits some attractive features from both approaches. On the one hand, it allows effective control of the size of quadratic programming subproblems via the compression and aggregation techniques of proximal bundle methods. On the other hand, the filter criterion for accepting a candidate point as the new iterate is sometimes easier to satisfy than the usual descent condition in bundle methods. Some encouraging preliminary computational results are also reported.
More About the Author
Elizabeth Karlsen (born 1960) is a British film producer. She co-founded Number 9 Films in 2002 with partner Stephen Woolley.
Review and Comments
Rate the Book
A bundle-filter method for nonsmooth convex constrained optimization 0 out of 5 stars based on 0 ratings.