Decomposition approach for the global minimization of biconcave functions over polytopes
暂无分享,去创建一个
[1] R. Horst,et al. Global Optimization: Deterministic Approaches , 1992 .
[2] Nguyen V. Thoai,et al. Convergent Algorithms for Minimizing a Concave Function , 1980, Math. Oper. Res..
[3] Reiner Horst,et al. A new algorithm for solving the general quadratic programming problem , 1993, Comput. Optim. Appl..
[4] Nguyen V. Thoai. A global optimization approach for solving the convex multiplicative programming problem , 1991, J. Glob. Optim..
[5] R. Horst,et al. On the convergence of global methods in multiextremal optimization , 1987 .
[6] Harold P. Benson,et al. Concave Minimization: Theory, Applications and Algorithms , 1995 .
[7] Reiner Horst,et al. Constraint decomposition algorithms in global optimization , 1993, J. Glob. Optim..
[8] Nguyen V. Thoai,et al. Concave minimization via conical partitions and polyhedral outer approximation , 1991, Math. Program..
[9] Pierre Hansen,et al. On-line and off-line vertex enumeration by adjacency lists , 1991, Oper. Res. Lett..
[10] Reiner Horst,et al. Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems , 1988, Math. Program..
[11] Reiner Horst,et al. An algorithm for nonconvex programming problems , 1976, Math. Program..
[12] R. Horst,et al. On finding new vertices and redundant constraints in cutting plane algorithms for global optimization , 1988 .
[13] Hoang Tuy,et al. Concave minimization under linear constraints with special structure , 1985 .
[14] P. Pardalos,et al. Handbook of global optimization , 1995 .