Sciweavers

32 search results - page 2 / 7
» Parallel algorithms to solve two-stage stochastic linear pro...
Sort
View
FOCS
1990
IEEE
13 years 8 months ago
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
Noga Alon, Nimrod Megiddo
ISCAS
2005
IEEE
179views Hardware» more  ISCAS 2005»
13 years 10 months ago
Robust stabilization of control systems using piecewise linear Lyapunov functions and evolutionary algorithm
— Piecewise linear Lyapunov functions are used to design control gain matrices so that closed systems are robust stable and attractive regions are expanded as large as possible i...
K. Tagawa, Y. Ohta
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
13 years 10 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth
PC
2002
118views Management» more  PC 2002»
13 years 4 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin
IOR
2010
98views more  IOR 2010»
13 years 1 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith