✦ LIBER ✦

Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications

✍ Scribed by Danny Z. Chen; Ovidiu Daescu; Yang Dai; Naoki Katoh; Xiaodong Wu; Jinhui Xu

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 435 KB
Volume: 9
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-005-5485-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for solving certain

Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions

✍ Le D. Muu; Bui T. Tam; S. Schaible 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 534 KB

A Bilinear Algorithm for Optimizing a Li

A Bilinear Algorithm for Optimizing a Linear Function over the Efficient Set of a Multiple Objective Linear Programming Problem

✍ Jesús M. Jorge 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 145 KB

Efficient and robust algorithms for solu

Efficient and robust algorithms for solution of the adjoint compressible Navier–Stokes equations with applications

✍ Richard P. Dwight; Joël Brezillon 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 1009 KB

On computing the largest fraction of mis

On computing the largest fraction of missing information for the EM algorithm and the worst linear function for data augmentation

✍ Chris Fraley 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 172 KB

We address the problem of computing the largest fraction of missing information for the EM algorithm and the worst linear function for data augmentation. These are the largest eigenvalue and its associated eigenvector for the Jacobian of the EM operator at a maximum likelihood estimate, which are im

An efficient algorithm for the design of

An efficient algorithm for the design of circular symmetric linear phase recursive digital filters with separable denominator transfer function

✍ M. Ahmadi; Henry J.J. Lee; M. Shridhar; V. Ramachandran 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 465 KB

Two new algorithms for solving optimizat

Two new algorithms for solving optimization problems with one linear objective function and finitely many constraints of fuzzy relation inequalities

✍ Ali Abbasi Molai 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 877 KB

This paper studies the optimization model of a linear objective function subject to a system of fuzzy relation inequalities (FRI) with the max-Einstein composition operator. If its feasible domain is non-empty, then we show that its feasible solution set is completely determined by a maximum solutio