๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Multiplicative iterative algorithms for convex programming

โœ Scribed by P.P.B. Eggermont


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
789 KB
Volume
130
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Deterministic Algorithms for 2-d Convex
โœ Timothy M Chan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

We present a deterministic algorithm for solving two-dimensional convex pro-ลฝ . grams with a linear objective function. The algorithm requires O k log k primitive operations for k constraints; if a feasible point is given, the bound reduces to ลฝ . O k log krlog log k . As a consequence, we can decid

Multiple-criterion control: a convex pro
โœ J.R.H. Carvalho; P.A.V. Ferreira ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 669 KB

Ahstrad-The performance of linear dynamic systems with respect to a non-linear increasing value function that aggregates convex functionals is investigated within a convex programming framework. The methodology developed in this paper combines fundamental properties of convex sets in order to decomp

A Constrained Block Iterative Algorithm
โœ John F. Doherty; Yu-Tsun Hsieh ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 116 KB

An interference suppression scheme using a block iterative, row-action projection (RAP) algorithm for direct-sequence spread-spectrum (DS/SS) code-division multiple-access (CDMA) systems is presented. The performance results for the near-far multiple-access interference scenario using the RAP algori

A Parallel Algorithm for Linear Programs
โœ Shih-Mim Liu; G.P. Papavassilopoulos ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 211 KB

A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (โ‰คn) processors are used for a problem with n variables and a globally optimal solution is fo