View Document Preview and Link Document Date: 2004-08-24 16:07:25 Open Document File Size: 135,86 KB Share Result on Facebook
City Berlin / Danvers / Amsterdam / Dordrecht / New York / / Company Oxford University Press / Elsevier Science B. V. / Boyd & Fraser Publishing Company / Y. S. A. / / Country Germany / Netherlands / Canada / / / Facility Carleton University / Stanford University / University of Haifa / / IndustryTerm sequential projection algorithms / simultaneous projection algorithms / approximate algorithms / constraint consensus algorithm / optimization using exhaustive search algorithms / projection algorithms / simultaneous component-averaging gradient-projection algorithm / nonlinear-programming applications / usual simultaneous projection algorithm / linear-programming solutions / reduced-gradient solution / optimization systems / projection algorithm / chemical equilibrium problem / iterative parallel algorithm / web repository / linear programming solution / / Organization Carleton University / Ottawa / Stanford University / University of Haifa / Oxford University / Nonlinear Programs John W. Chinneck Department of Systems and Computer Engineering / Natural Sciences and Engineering Research Council of Canada / / Person W. David Kelton / Michael Saunders / / Position author / General / model in the sampling region / / ProgrammingLanguage AMPL / / ProvinceOrState New York / Massachusetts / Ontario / / SportsLeague Stanford University / / Technology Alternative Stopping Conditions The algorithm / optimization using exhaustive search algorithms / simultaneous component-averaging gradient-projection algorithm / sequential projection algorithms / projection algorithm / usual simultaneous projection algorithm / Optimization Algorithms / simultaneous projection algorithms / constraint consensus algorithm / Inherently Parallel Algorithms / iterative parallel algorithm / html / Projection Algorithms / / URL http / SocialTag 
INFORMS Journal on Computing informs Vol. 16, No. 3, Summer 2004, pp. 255–265 issn[removed] eissn[removed] 04 1603 0255