𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Lagrangian algorithm for equality constrained generalized polynomial optimization

✍ Scribed by Gary E. Blau; Douglass J. Wilde

Publisher
American Institute of Chemical Engineers
Year
1971
Tongue
English
Weight
520 KB
Volume
17
Category
Article
ISSN
0001-1541

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A polynomial algorithm for a constrained
A polynomial algorithm for a constrained traveling salesman problem
✍ J.H. Rubinstein; D.A. Thomas; N.C. Wormald πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 125 KB

## Abstract We give a polynomial‐time algorithm for finding a solution to the Traveling Salesman Problem when the points given are constrained to lie on a fixed set of smooth curves of finite length. Β© 2001 John Wiley & Sons, Inc.

A new Lagrangian dual global optimizatio
A new Lagrangian dual global optimization algorithm for solving bilinear matrix inequalities
✍ H. D. Tuan; P. Apkarian; Y. Nakashima πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 202 KB πŸ‘ 2 views

A new global optimization algorithm for solving bilinear matrix inequalities (BMI) problems is developed. It is based on a dual Lagrange formulation for computing lower bounds that are used in a branching procedure to eliminate partition sets in the space of complicating variables. The advantage of

A polynomial time algorithm for rectilin
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves
✍ Brazil, M.; Thomas, D. A.; Weng, J. F. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 168 KB πŸ‘ 2 views

The rectilinear Steiner problem is the problem of constructing the shortest rectilinear network in the plane connecting a given set of points, called terminals. The problem is known to be NP-complete in general. In this paper, we show that there is a polynomial time algorithm for solving the rectili

A Cost-Optimal Pipeline Algorithm for Pe
A Cost-Optimal Pipeline Algorithm for Permutation Generation in Lexicographic Order
✍ ClΓ©mentin Tayou Djamegni; Maurice TchuentΓ© πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 142 KB

In this paper we solve the open problem of designing a costoptimal parallel algorithm for generating permutations of M elements out of the set {0, 1, . . . , N -1}, in lexicographic order. Our algorithm runs on the simplest model of parallel computation, i.e., a linear array of size M, where each pr