✦ LIBER ✦

A simple bilinear optimization problem

✍ Scribed by H.S. Witsenhausen

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 296 KB
Volume: 8
Category: Article
ISSN: 0167-6911
DOI: 10.1016/0167-6911(86)90022-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple solution to the l1 optimization

A simple solution to the l1 optimization problem

✍ Mark A Mendlovitz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Optimization algorithms for bilinear mod

Optimization algorithms for bilinear model–based predictive control problems

✍ H. H. J. Bloemen; T. J. J. van den Boom; H. B. Verbruggen 📂 Article 📅 2004 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 137 KB 👁 2 views

On simple combinatorial optimization pro

On simple combinatorial optimization problems

✍ A.J. Hoffman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 228 KB

We characterize (0,l) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.

A problem in infinite bilinear programmi

A problem in infinite bilinear programming

✍ S.A. Kas'yanyuk 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 244 KB

Bilinear quadratic optimal control: a re

Bilinear quadratic optimal control: a recursive approach

✍ B. Chanane 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB 👁 2 views

This paper deals with the time-varying bilinear quadratic optimal control problem. Using Adomian's decomposition method, we shall first derive a functional expansion for the input-output map of the system, then transform the cost functional so that it yields the optimal control in a recursive manner

Bilinear optimal control of a Kirchhoff

Bilinear optimal control of a Kirchhoff plate

✍ M.E Bradley; S Lenhart 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 501 KB