Abstract
A dual l p-norm perturbation approach is introduced for solving convex quadratic programming problems. The feasible region of the Lagrangian dual program is approximated by a proper subset that is defined by a single smooth convex constraint involving the l p-norm of a vector measure of constraint violation. It is shown that the perturbed dual program becomes the dual program as p→∞ and, under some standard conditions, the optimal solution of the perturbed dual program converges to a dual optimal solution. A closed-form formula that converts an optimal solution of the perturbed dual program into a feasible solution of the primal convex quadratic program is also provided. Such primal feasible solutions converge to an optimal primal solution as p→∞. The proposed approach generalizes the previously proposed primal perturbation approach with an entropic barrier function. Its theory specializes easily for linear programming.
Similar content being viewed by others
References
GILL, P. E., MURRAY, W., SAUNDERS, M. A., TOMLIN, J. A., and WRIGHT, M. H., On Projected Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method, Mathematical Programming, Vol. 36, pp. 183–209, 1986.
MEGIDDO, N., Progress in Mathematical Programming: Interior-Point and Related Methods, Springer Verlag, New York, New York, 1989.
DEN HERTOG, D., ROOS, C., and TERLAKY, T., Inverse Barrier Methods for Linear Programming, Report 90–27, Technical Mathematics and Informatics, Delft University of Technology, Delft, Netherlands, 1990.
FANG, S. C., A New Unconstrained Convex Programming View of Linear Programming, Zeitschrift fur Operations Research, Vol. 36, pp. 149–161, 1992.
FANG, S. C., and TSAO, H. S. J., An Unconstrained Convex Programming Approach to Solving Convex Quadratic Programming Problems, Optimization, Vol. 27, pp. 235–243, 1993.
FANG, S. C., and PUTHENPURA, S., Linear Optimization and Extensions: Theory and Algorithms, Prentice-Hall, Englewood Cliffs, New Jersey, 1993.
VAN DE PANNE, C., Methods for Linear and Quadratic Programming, North Holland, Amsterdam, Netherlands, 1975.
CHUNG, K. L., A Course in Probability Theory, 2nd Edition, Academic Press, New York, New York, 1974.
POLYAK, R. A., On the Best Convex Chebyshev Approximation, Soviet Mathematics-Doklady, Vol. 12, pp. 1441–1444, 1971.
CHARALAMBOUS, C., Nonlinear Least pth Optimization and Nonlinear Programming, Mathematical Programming, Vol. 12, pp. 195–225, 1977.
BERTSEKAS, D., Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, New York, 1989.
CHARALAMBOUS, C., Acceleration of the Least pth Algorithm for Minimax Optimization with Engineering Applications, Mathematical Programming, Vol. 17, pp. 270–297, 1979.
POLYAK, R. A., Smooth Optimization Methods for Minimax Problems, SIAM Journal on Control and Optimization, Vol. 26, pp. 1274–1286, 1988.
FANG, S. C., and TSAO, H. S. J., A Dual Perturbation View of Linear Programming, Mathematical Methods of Operations Research, Vol. 44,No. 1, pp. 1–10, 1996.
GILL, P. E., MURRAY, T. A., and WRIGHT, M. H., Practical Optimization, Academic Press, London, England, 1981.
ZANGWILL, W. I., Nonlinear Programming: A Unified Approach, Prentice-Hall, Englewood Cliffs, New Jersey, 1969.
HOGAN, W. W., Point-to-set Maps in Mathematical Programming, SIAM Review, Vol. 15, pp. 591–603, 1973.
FIACCO, A. V., Introduction to Sensitivity and Stability Analysis in Nonlinear Programming, Academic Press, New York, New York, 1983.
FIACCO, A. V., and LIU, J., On the Stability of General Convex Programs under Slater's Condition and Primal Solution Boundedness, Optimization, Vol. 32, pp. 291–300, 1995.
ROBINSON, S. M., and DAY, R., A Sufficient Condition for Continuity of Optimal Sets in Mathematical Programming, Journal of Mathematical Analysis and Applications, Vol. 45, pp. 506–511, 1974.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fang, S.C., Tsao, H.S.J. Perturbing the Dual Feasible Region for Solving Convex Quadratic Programs. Journal of Optimization Theory and Applications 94, 73–85 (1997). https://doi.org/10.1023/A:1022655502360
Issue Date:
DOI: https://doi.org/10.1023/A:1022655502360