Abstract
In this paper we consider optimization problems defined by a quadratic objective function and a finite number of quadratic inequality constraints. Given that the objective function is bounded over the feasible set, we present a comprehensive study of the conditions under which the optimal solution set is nonempty, thus extending the so-called Frank-Wolfe theorem. In particular, we first prove a general continuity result for the solution set defined by a system of convex quadratic inequalities. This result implies immediately that the optimal solution set of the aforementioned problem is nonempty when all the quadratic functions involved are convex. In the absence of the convexity of the objective function, we give examples showing that the optimal solution set may be empty either when there are two or more convex quadratic constraints, or when the Hessian of the objective function has two or more negative eigenvalues. In the case when there exists only one convex quadratic inequality constraint (together with other linear constraints), or when the constraint functions are all convex quadratic and the objective function is quasi-convex (thus allowing one negative eigenvalue in its Hessian matrix), we prove that the optimal solution set is nonempty.
Similar content being viewed by others
References
A. Auslender, “How to deal with the unbounded in optimization: Theory and algorithms,” Mathematical Programming Series B, vol. 79, pp. 3-8, 1997.
M. Avriel, W.E. Diewert, S. Schaible, and I. Zang, Generalized Concavity, Plenum Press: New York, 1988.
E. Blum and W. Oettli, “Direct proof of the existence theorem in quadratic programming,” Operations Research, vol. 20, pp. 165-167, 1972.
V. Chvátal, Linear Programming, W.H. Freeman and Company: New York, 1983.
B.C. Eaves, “On quadratic programming,” Management Science, vol. 17, pp. 698-711, 1971.
C.A. Floudas and V. Visweswaran, “Quadratic optimization,” in Handbook of Global Optimization, R. Horn and P.M. Pardalos (Eds.), Kluwer Academic Publishers: The Netherlands, 1995, pp. 217-269.
M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval Research Logistics Quarterly, vol. 3, pp. 95-110, 1956.
A.J. Hoffman, “On approximate solutions of systems of linear inequalities,” Journal of Research of the National Bureau of Standards, vol. 49, pp. 263-265, 1952.
Z.-Q. Luo, “On the solution set continuity of the convex quadratic feasibility problem,” unpublished manuscript, Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario, Canada, September 1995.
Z.-Q. Luo, J.F. Sturm, and S. Zhang, “Duality results for conic convex programming,” Report 9719/A, Econometric Institute, Erasmus University Rotterdam, 1997.
Z.-Q. Luo and P.Y. Tseng, “Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem,” SIAM J. Optimization, vol. 2, pp. 43-54, 1992.
O.L. Mangasarian and L.L. Schumaker, “Discrete splines via mathematical programming,” SIAM Journal on Control, vol. 9, pp. 174-183, 1971.
T. Matsui, “NP-hardness of linear multiplicative programming and related problems,” Report METR95-13, University of Tokyo, Japan, 1995.
A.F. Perold, “A generalization of the Frank-Wolfe theorem,” Mathematical Programming, vol. 18, pp. 215-227, 1980.
S.M. Robinson, “Some continuity properties of polyhedral multifunctions,” Mathematical Programming Study, vol. 14, pp. 206-214, 1981.
T. Terlaky, “On lp programming,” European Journal of Operations Research, vol. 22, pp. 70-100, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Luo, ZQ., Zhang, S. On Extensions of the Frank-Wolfe Theorems. Computational Optimization and Applications 13, 87–110 (1999). https://doi.org/10.1023/A:1008652705980
Issue Date:
DOI: https://doi.org/10.1023/A:1008652705980