On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes

Computational Optimization and Applications

Volumn 33, Issue 2-3, 2006, Pages 349-364

  Obuchowska, Wiesława T ^a  

^a Chowan University   (United States)

Author keywords

Cone of recession; Convex and quasi convex constrained programs; Existence of optimal solutions

Indexed keywords

CONE OF RECESSION; CONVEX AND QUASI-CONVEX CONSTRAINED PROGRAMS; EXISTENCE OF OPTIMAL SOLUTIONS;

CONSTRAINT THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

THEOREM PROVING;

EID: 33645139512     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-005-3063-2     Document Type: Article

References (21)

1. R.A. Abrams, "Projections of convex programs with unattained infima," SIAM J. Control, vol. 13, no. 3, pp. 706-718, 1975.
2. A. Auslender, "How to deal with unbounded in optimization: Theory and algorithms," Mathematical Programming, Series B, vol. 79, pp. 3-18, 1997.
3. B. Bank and R. Mandel, Parametric Integer Optimization, Mathematical Research, Academie-Verlag: Berlin, vol. 39, 1988.
4. E.G. Belousov and D. Klatte, "A Frank-Wolfe type Theorem for convex polynomial programs," Computational Optimization and Applications, vol. 22, pp. 37-48, 2002.
5. R.J. Caron and W.T. Obuchowska, "Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints," European Journal of Operational Research, vol. 63, pp. 114-123, 1992.
6. R.J. Caron and W.T. Obuchowska, "An algorithm to determine boundedness of quadratically constrained convex quadratic programmes," European Journal of Operational Research, vol. 80, pp. 431-438, 1995.
7. B.C. Eaves, "On quadratic programming," Management Science, vol. 17, pp. 698-711, 1971.
8. C.A. Floudas, Nonlinear and Mixed-Integer Optimization; Fundamentals and Applications, Oxford University Press, 1995.
9. M. Frank and P. Wolfe, "An algorithm for quadratic programming," Naval Research Logistics Quarterly, vol. 3, pp. 95-110, 1956.
10. J.-B. Hiriart-Urutty and C. Lemarechal, Convex Analysis and Minimization Algorithms I, Springer-Verlag, 1993.
11. Z.-Q. Luo and S. Zhang, "On extensions of the Frank-Wolfe Theorems," Computational Optimization and Applications, vol. 13, pp. 87-110, 1999.
12. W.T. Obuchowska, "Quadratic Programmes with Quadratic Constraints," Ph.D. thesis, University of Windsor, 1995.
13. W.T. Obuchowska, "Convex constrained programmes with unattained infima," Journal of Mathematical Analysis and Applications, vol. 234, pp. 232-245, 1999.
14. W.T. Obuchowska, "On the minimizing trajectory of convex functions with unbounded level sets," Computational Optimization and Applications, vol. 27, pp. 37-52, 2004.
15. W.T. Obuchowska, "Remarks on the analytic centres of convex sets," Computational Optimization and Applications, vol. 29, pp. 69-90, 2004.
16. W.T. Obuchowska and K.G. Murty, "Cone of recession and unboundedness of convex functions," European Journal of Operational Research, vol. 133, pp. 409-415, 2001.
17. J.-S. Pang, "Error bounds in mathematical programming," Mathematical Programming, Series B, vol. 79, pp. 299-332, 1999.
18. A.F. Perold, "A generalization of the Frank-Wolfe Theorem," Mathematical Programming, vol. 18, pp. 215-227, 1980.
19. R.T. Rockafellar, "Some convex programs whose duals are linearly constrained," in Nonlinear Programming, J.B. Rosen, O.L. Mangasarian and K. Ritter (Eds.), Academic Press: New York, 1970.
20. R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1979.
21. p programming," European Journal of Operational Research, vol. 22, pp. 70-100, 1985.