An application of Lipschitzian global optimization to product design

Al-Khayyal F. A. and Falk J. E. (1983), Jointly Constrained Biconvex Programming, Mathematics of Operations Research 8, 273–286. Al-Khayyal F. A. (1990), Jointly Constrained Bilinear Programs and Related Problems: An Overview, Computers, & Mathematics with Applications 11, 53–62. Baritompa W. (1991), Customizing Methods for Global Optimization: A Bisection Viewpoint. Preprint, University of Canterbury, New Zealand. Csiszár I. (1975). I-Divergence Geometry of Probability Distributions and Minimization Problems, Annals of Probability 3, 146–158. Danilin, Yu. and Piyavskii, S. A. (1967), An Algorithm for Finding the Absolute Minimum, in: Theory of Optimal Decisions 2, 25–37, Institute of Cybernetics of the Ukrainian Academy of Sciences. (In Russian.) Foulds L. R., Haugland D., and Jörnsten K. (1991), A Bilinear Approach to the Pooling Problem. Working paper no 90/03 Chr. Michelsen Institute, Centre for Petroleumeconomics, Bergen, Norway. To appear in Mathematical Programming. Horst R. (1986), A General Class of Branch-and-Bound Methods in Global Optimization with Some New Approaches for Concave Minimization, J. of Optimization Theory and Applications 51, 271–291. Horst R. and Tuy H. (1987), On the Convergence of Global Methods in Multiextremal Optimization, J. of Optimization Theory and Applications 54, 253–271. Horst R. and Thoai Ng. V. (1988), Branch-and-Bound Methods for Solving Systems of Lipschitzian Equations and Inequalities, J. of Optimization Theory and Applications 58, 139–145. Horst R. (1988), Deterministic Global Optimization with Partition Sets whose Feasibility Is Not Known: Application to Concave Minimization, Reverse Convex Constraints, DC-Programming and Lipschitzian Optimization, J. of Optimization Theory and Applications 58, 11–37. Horst R. and Tuy H. (1990), Global Optimization (Deterministic Approaches), Springer, Berlin. Klafszky E., Mayer J., and Terlaky T. (1989), Linearly Constrained Estimation by Mathematical Programming, European Journal of Operational Research 34, 254–267. Manas M. (1968), An Algorithm for a Nonconvex Programming Problem, Economic. Mathem. Obzor 4, 202–212. Meewella C. C. and Mayne D. Q. (1988), An Algorithm for Global Optimization of Lipschitz Continuous Functions, J. of Optimization Theory and Applications 57, 307–322. Mladineo R. H. (1986), An Algorithm for Finding the Global Maximum of a Multimodal, Multivariate Functions, Mathematical Programming 34, 188–200. Pardalos P. M., Glick J. H., and Rosen J. B. (1987), Global Minimization of Indefinite Quadratic Problems, Computing 39, 281–291. Pardalos P. M. and Rosen J. B. (1987), Constrained Global Optimization: Algorithms and Applications, Springer, Berlin. Pintér J. (1986), Extended Univariate Algorithms for n-Dimensional Global Optimization, Computing 36, 91–103. Pintér, J. (1986), Extended Univariate Algorithms for n-Dimensional Global Optimization, Research Report 87-61, Department of Mathematics and Informatics, Delft University of Technology (revised version to appear in Mathematical Programming). Pintér, J. and Cooke, R. (1987), Combining Expert Opinions: An Optimization Framework, Research Report 87-84, Department of Mathematics and Informatics, Delft University of Technology. Pintér J. (1988), Branch-and-Bound Algorithms for Solving Global Optimization Problems with Lipschitzian Structure, Optimization 19, 101–110. Pintér J (1990), Simplicial Partition Strategies, for Lipschitzian Global Optimization. Preprint, Institute for Inland Water Management and Waste Water Treatment, Lelystad, The Netherlands. Rinnooy Kan A. H. G. and Timmer G. T. (1987), Stochastic Global Optimization Methods: I. Clustering Methods, Mathematical Programming 39, 27–56. Rinnooy Kan A. G. H. and Timmer G. T. (1987), Stochastic Global Optimization Methods: II. Multilevel Methods, Mathematical Programming 39, 57–78. Shubert B. O. (1972), A Sequential Method Seeking the Global Maximum of a Function, SIAM Journal of Numerical Analysis 9, 379–388. Wood G. R. (1991), The Bisection Method in Higher Dimensions, Preprint, University of Canterbury, New Zealand, To appear in Mathematical Programming.