𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Neural network for non-linear programming with linear equality constraints

✍ Scribed by Stanisłsaw Osowski

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
326 KB
Volume
20
Category
Article
ISSN
0098-9886

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Indefinitely preconditioned inexact Newt
Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems
✍ Ladislav Lukšan; Jan Vlček 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 2 views

An inexact Newton algorithm for large sparse equality constrained non-linear programming problems is proposed. This algorithm is based on an indefinitely preconditioned smoothed conjugate gradient method applied to the linear KKT system and uses a simple augmented Lagrangian merit function for Armij

Non-linear modelling with a coupled neur
Non-linear modelling with a coupled neural network — PLS regression system
✍ Greger Andersson; Peter Kaufmann; Lars Renberg 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 485 KB 👁 2 views

In this work a methodology is presented for the transformation of non-linear response data via a neural network and subsequent standard linear PLS regression. The superb transparency of linear PLS is retained with respect to the diagnostic capabilities via residual analysis and leverage, thus making

A reconfigurable analog VLSI neural netw
A reconfigurable analog VLSI neural network architecture with non-linear synapses
✍ Bo, G. M.; Caviglia, D. D.; Valle, M.; Stratta, R.; Trucco, E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB 👁 1 views

In this paper a reconfigurable analog VLSI neural network architecture is presented. The analog architecture implements a Multi-Layer Perceptron whose topology can be programmed without any modification of the off-chip connections. The architecture is scaleable and modular since it is based on a sin

A Parallel Algorithm for Linear Programs
A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint
✍ 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