✦ LIBER ✦

A New Accuracy Criterion for Approximate Proximal Point Algorithms

✍ Scribed by Deren Han; Bingsheng He

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 91 KB
Volume: 263
Category: Article
ISSN: 0022-247X
DOI: 10.1006/jmaa.2001.7535

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new adaptive GMRES algorithm for achie

A new adaptive GMRES algorithm for achieving high accuracy

✍ Maria Sosonkina; Layne T. Watson; Rakesh K. Kapania; Homer F. Walker 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB 👁 2 views

GMRES(k) is widely used for solving nonsymmetric linear systems. However, it is inadequate either when it converges only for k close to the problem size or when numerical error in the modified Gram-Schmidt process used in the GMRES orthogonalization phase dramatically affects the algorithm performan

A new proximal decomposition algorithm f

A new proximal decomposition algorithm for routing in telecommunication networks

✍ Mahey, P.; Ouorou, A.; LeBlanc, L.; Chifflet, J. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

We present a new and much more efficient implementation of the proximal decomposition algorithm for routing in congested telecommunication networks. The routing model that we analyze is a static one intended for use as a subproblem in a network design context. After describing our new implementation

A new three-point approximation approach

A new three-point approximation approach for design optimization problems

✍ Xu Guo; Koetsu Yamazaki; Geng Dong Cheng 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 1 views

In this paper, a newly developed three-point approximation scheme is proposed. The expression of this scheme consists of a linear combination of the direct and reciprocal linear Taylor expansions as well as of the lumped diagonal terms of the second-order direct and inverse terms. The unknown parame

New algorithms for (Q,r) systems with co

New algorithms for (Q,r) systems with complete backordering using a fill-rate criterion

✍ Candace Arai Yano 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 555 KB

We present an algorithm which determines optimal parameter values for order quantityreorder point systems with complete backordering. The service level is measured as fraction of demand satisfied directly from shelf, also known as "fill-rate." This algorithm differs from existing algorithms because

A New Approximation Algorithm for the St

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3

✍ Hans Jürgen Prömel; Angelika Steger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 100 KB

In this paper we present an RNC approximation algorithm for the Steiner tree problem in graphs with performance ratio 5r3 and RNC approximation algorithms for the Steiner tree problem in networks with performance ratio 5r3 q ⑀ for all ⑀ ) 0. This is achieved by considering a related problem, the min

A new fixed-point algorithm for hardenin

A new fixed-point algorithm for hardening plasticity based on non-linear mixed variational inequalities

✍ P. Venini; R. Nascimbene 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB