The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs

Published Online:https://doi.org/10.1287/ijoc.1030.0046

References

  • Censor Y., Elfving T., Herman G. T., Butnariu D., Censor Y., Reich S. Averaging strings of sequential iterations for convex feasibility problems. Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (2001) (Elsevier Science B. V., Amsterdam, The Netherlands) 101–113CrossrefGoogle Scholar
  • Censor Y., Gordon D., Gordon R. Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems. Parallel Comput. (2001) 27:777–808CrossrefGoogle Scholar
  • Censor Y., Zenios S. A.Parallel Optimization: Theory, Algorithms, and Applications (1997) (Oxford University Press, New York) Google Scholar
  • Chinneck J. W. Analyzing mathematical programs using MProbe. Ann. Oper. Res. (2001a) 104:33–48CrossrefGoogle Scholar
  • Chinneck J. W. Discovering the characteristics of mathematical programs via sampling. Optim. Methods Software (2001b) 17:319–352CrossrefGoogle Scholar
  • Chinneck J. W. (2002) . MProbe web page http://www.sce.carleton.ca/faculty/chinneck/mprobe.htmlGoogle Scholar
  • Cimmino G. Calcolo Approssimato per Soluzioni dei Sistemi di Equazioni Lineari. La Ricerca Sci. XVI., Ser. II, Anno IX (1938) 1:326–333Google Scholar
  • Floudas C. A., Pardalos P. M.A Collection of Test Problems for Constrained Global Optimization Algorithms (1990) (Springer-Verlag, Berlin, Germany) CrossrefGoogle Scholar
  • Floudas C. A., Pardalos P. M., Adjiman C. S., Esposito W. R., Gumus Z. H., Harding S. T., Klepeis J. L., Meyer C. A., Schweiger C. A.Handbook of Test Problems in Local and Global Optimization (1999) (Kluwer Academic Publishers, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Fourer R., Gay D. M., Kernighan B. W.AMPL: A Modeling Language for Mathematical Programming (1993) (Boyd & Fraser Publishing Company, Danvers, MA) Google Scholar
  • Himmelblau D. M.Applied Nonlinear Programming (1972) (McGraw-Hill Book Company, New York) Google Scholar
  • Kearfott R. B., Dian J. An iterative method for finding approximate feasible points. (2000) . Technical report, Department of Mathematics, University of Southwestern Louisiana, Lafayette, LAGoogle Scholar
  • Murtagh B. A., Saunders M. A. MINOS 5.4 User's Guide (Preliminary). (1993) . Technical Report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CAGoogle Scholar
  • Pardalos P. M., Resende M. G. C.Handbook of Applied Optimization (2002) (Oxford University Press, Oxford, U.K) CrossrefGoogle Scholar
  • Polak E.Optimization: Algorithms and Consistent Approximations (1997) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Vanderbei R. (2002) . Web Repository of AMPL Test Models. http://www.sor.princeton.edu/~rvdb/ampl/nlmodels/index.htmlGoogle Scholar
  • Xiao Y., Censor Y., Michalski D., Galvin J. The least-intensity feasible solution for aperture-based inverse planning in radiation therapy. Ann. Oper. Res. (2003) 119:183–203CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.