Global minimization algorithms for concave quadratic programming problems

Optimization

Volumn 54, Issue 6, 2005, Pages 627-639

  Chinchuluun, Altannar ^a   Pardalos, Panos M ^a   Enkhbat, Rentsen ^b  

^a J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

^b NATIONAL UNIVERSITY OF MONGOLIA   (Mongolia)

Author keywords

Approximation set; Concave quadratic programming; Global optimization; Level set; Second order approximation set

Indexed keywords

EID: 30944456754     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331930500342534     Document Type: Article

References (18)

1. Bertsekas, D.P., 1995, Nonlinear Programming (Belmont, Massachusetts; Athena Scientific).
2. Coleman, T.F. and Li, Y., 1996, A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables. SIAM Journal on Optimization, 6, 1040-1058.
3. Dantzig, G.B., Orden, A. and Wolfe P., 1955, Generalized simplex method for minimizing a linear from under linear inequality constraints. Pacific Journal of Mathematics, 5, 183-195.
4. Dür, M., Horst, R. and Locatelli, M., 1998, Necessary and sufficient global optimality conditions for convex maximization revisited. Journal of Mathematical Analysis and Applications, 217, 637-649.
5. Enkhbat, R., 1996, An algorithm for maximizing a convex function over a simple set. Journal of Global Optimization, 8, 379-391.
6. Enkhbat, R. and Ibaraki, T., 2001, Global optimization algorithms for general quadratic programming, Journal of the Mongolian Mathematical Society, 5, 22-57.
7. Gill, P. É., Murray, W. and Wright, M.H., 1981, Practical Optimization (London, UK: Academic Press).
8. Hiriart-Urruty, J.B. and Ledyav, J.S., 1996, A note in the characterization of the global maxima of a convex function over a convex set. Journal of Convex Analysis, 3, 55-61.
9. Horst, R. and Tuy, H., 1990, Global Optimization (Deterministic Approaches) (Berlin, Springer).
10. Horst, R. and Pardalos, P.M. (Eds), 1995, Handbook of Global Optimization (Netherlands: Kluwer Academic).
11. Khachiyan, L., 1979, A polynomial algorithm in linear programming. Soviet Math. Doklady, 20, 191-194.
12. Mehrotra, S., 1992, On the implementation of a primal-dual interior point method. SIAM Journal on Optimization, 2, 575-601.
13. Pardalos, P.M. and Rosen, J.B., 1987, Constrained Global Optimization: Algoritlms and Applications, Lecture Notes in Computer Science (Springer-Verlag).
14. Pardalos, P.M. and Rosen, J.B., 1986, Methods for global concave minimization: a bibliographic survey. SIAM Review, 28, 367-379.
15. Strekalovsky, A.S., 1987, On the global extremum problem. Soviet Math. Doklady, 292(5), 1062-1066.
16. Strekalovsky, A.S., 1998, Global optimality conditions for nonconvex optimization. Journal of Global Optimization, 12, 415-434.
17. Strekalovsky, A.S. and Enkhbat, R., 1990, Global maximum of convex functions on an arbitrary set. Dep. in VINITI, Irkutsk, No. 1063, pp. 1-27.
18. Thoai, N.V., 1994, On the construction of test problems for concave minimization problem. Journal of Global Optimization, 5, 399-402.