𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Kronecker approximation with a convex constrained optimization method for blind image restoration

✍ Scribed by A. Bouhamidi, K. Jbilou

Book ID
118815422
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
514 KB
Volume
6
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A bundle-filter method for nonsmooth con
A bundle-filter method for nonsmooth convex constrained optimization
✍ Elizabeth Karas; Ademir Ribeiro; Claudia SagastizΓ‘bal; Mikhail Solodov πŸ“‚ Article πŸ“… 2007 πŸ› Springer-Verlag 🌐 English βš– 295 KB

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, i

A modification of convex approximation m
A modification of convex approximation methods for structural optimization
✍ Wei-Hong Zhang; C. Fleury πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 624 KB

Ah&act--The most popular convex approximation methods used today in structural optimization are discussed in this paper: the convex linearization method (CONLIN), the method of the moving asymptotes (MMA) and the sequential quadratic programming method (SQP). Modifications are made to enhance the re