𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Acceleration Scheme for Solving Convex Feasibility Problems Using Incomplete Projection Algorithms

✍ Scribed by N. Echebest; M.T. Guardarucci; H. Scolnik; M.C. Vacchino

Book ID
111602812
Publisher
Springer US
Year
2004
Tongue
English
Weight
164 KB
Volume
35
Category
Article
ISSN
1017-1398

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An accelerated successive orthogonal pro
An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
✍ J.M. MartΓ­nez πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 390 KB

## Communicated by E. Y. Rodin Al~ract--We consider linear feasibility problems in the "standard" form Ax = b, I ~< x ~< u. The successive orthogonal projections method may be used for solving this problem using sparse orthogonal factorizations techniques for computing the projections on Ax = b. W

A BFGS-IP algorithm for solving strongly
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach
✍ Paul Armand; J. Charles Gilbert; Sophie Jan-JΓ©gou πŸ“‚ Article πŸ“… 2002 πŸ› Springer-Verlag 🌐 English βš– 289 KB

This paper introduces and analyses a new algorithm for minimizing a convex function subject to a finite number of convex inequality constraints. It is assumed that the Lagrangian of the problem is strongly convex. The algorithm combines interior point methods for dealing with the inequality constrai