Abstract
In this paper we are concerned with the problem of boundedness and the existence of optimal solutions to the constrained optimization problem.
We present necessary and sufficient conditions for boundedness of either a faithfully convex or a quasi-convex polynomial function over the feasible set defined by a system of faithfully convex inequality constraints and/or quasi-convex polynomial inequalities, where the faithfully convex functions satisfy some mild assumption. The conditions are provided in the form of an algorithm, terminating after a finite number of iterations, the implementation of which requires the identification of implicit equality constraints in a homogeneous linear system. We prove that the optimal solution set of the considered problem is nonempty, this way extending the attainability result well known as the so-called Frank-Wolfe theorem. Finally we show that our extension of the Frank-Wolfe theorem immediately implies continuity of the solution set defined by the considered system of (quasi)convex inequalities.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
R.A. Abrams, “Projections of convex programs with unattained infima,” SIAM J. Control, vol. 13, no. 3, pp. 706–718, 1975.
A. Auslender, “How to deal with unbounded in optimization: Theory and algorithms,” Mathematical Programming, Series B, vol. 79, pp. 3–18, 1997.
B. Bank and R. Mandel, Parametric Integer Optimization, Mathematical Research, Academie-Verlag: Berlin, vol. 39, 1988.
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.
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.
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.
B.C. Eaves, “On quadratic programming,” Management Science, vol. 17, pp. 698–711, 1971.
C.A. Floudas, Nonlinear and Mixed-Integer Optimization; Fundamentals and Applications, Oxford University Press, 1995.
M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval Research Logistics Quarterly, vol. 3, pp. 95–110, 1956.
J.-B. Hiriart-Urutty and C. Lemarechal, Convex Analysis and Minimization Algorithms I, Springer-Verlag, 1993.
Z.-Q. Luo and S. Zhang, “On extensions of the Frank-Wolfe Theorems,” Computational Optimization and Applications, vol. 13, pp. 87–110, 1999.
W.T. Obuchowska, “Quadratic Programmes with Quadratic Constraints,” Ph.D. thesis, University of Windsor, 1995.
W.T. Obuchowska, “Convex constrained programmes with unattained infima,” Journal of Mathematical Analysis and Applications, vol. 234, pp. 232–245, 1999.
W.T. Obuchowska, “On the minimizing trajectory of convex functions with unbounded level sets,” Computational Optimization and Applications, vol. 27, pp. 37–52, 2004.
W.T. Obuchowska, “Remarks on the analytic centres of convex sets,” Computational Optimization and Applications, vol. 29, pp. 69–90, 2004.
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.
J.-S. Pang, “Error bounds in mathematical programming,” Mathematical Programming, Series B, vol. 79, pp. 299–332, 1999.
A.F. Perold, “A generalization of the Frank-Wolfe Theorem,” Mathematical Programming, vol. 18, pp. 215–227, 1980.
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.
R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1979.
T. Terlaky, “On l p programming,” European Journal of Operational Research, vol. 22, pp. 70–100, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Obuchowska, W.T. On Generalizations of the Frank-Wolfe Theorem to Convex and Quasi-Convex Programmes. Comput Optim Applic 33, 349–364 (2006). https://doi.org/10.1007/s10589-005-3063-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-005-3063-2