Lipschitz programming via increasing convex-along-rays functions *
暂无分享,去创建一个
[1] Graham R. Wood,et al. The bisection method in higher dimensions , 1992, Math. Program..
[2] Panos M. Pardalos,et al. A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.
[3] Semen S. Kutateladze,et al. MINKOWSKI DUALITY AND ITS APPLICATIONS , 1972 .
[4] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[5] Diethard Pallaschke,et al. Foundations of mathematical optimization : convex analysis without linearity , 1997 .
[6] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[7] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[8] Graham R. Wood,et al. Multidimensional bisection: The performance and the context , 1993, J. Glob. Optim..
[9] Aimo A. Törn,et al. Global Optimization , 1999, Science.
[10] I. Singer. Abstract Convex Analysis , 1997 .
[11] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .
[12] J. Aubin,et al. Applied Nonlinear Analysis , 1984 .
[13] J D Pinter,et al. Global Optimization in Action—Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications , 2010 .
[14] Regina Hunter Mladineo. An algorithm for finding the global maximum of a multimodal, multivariate function , 1986, Math. Program..
[15] R. Enhbat. An algorithm for maximizing a convex function over a simple set , 1996, J. Glob. Optim..
[16] P. Pardalos,et al. Handbook of global optimization , 1995 .
[17] S. A. Piyavskii. An algorithm for finding the absolute extremum of a function , 1972 .
[18] A. M. Rubinov,et al. Increasing Convex-Along-Rays Functions with Applications to Global Optimization , 1999 .
[19] B. M. Glover,et al. Cutting angle methods in global optimization , 1999 .