Abstract
Numerical approaches are developed for solving large-scale problems of extended linear-quadratic programming that exhibit Lagrangian separability in both primal and dual variables simultaneously. Such problems are kin to large-scale linear complementarity models as derived from applications of variational inequalities, and they arise from general models in multistage stochastic programming and discrete-time optimal control. Because their objective functions are merely piecewise linear-quadratic, due to the presence of penalty terms, they do not fit a conventional quadratic programming framework. They have potentially advantageous features, however, which so far have not been exploited in solution procedures. These features are laid out and analyzed for their computational potential. In particular, a new class of algorithms, called finite-envelope methods, is described that does take advantage of the structure. Such methods reduce the solution of a high-dimensional extended linear-quadratic program to that of a sequence of low-dimensional ordinary quadratic programs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.W. Cottle, F. Giannessi and J.-L. Lions, eds.,Variational Inequalities and Complementarity Problems (Wiley, Chichester, 1980).
D. Goldfarb and S. Liu, “An O(n 3 L) primal interior point algorithm for convex quadratic programming,” preprint.
A. King, “An implementation of the Lagrangian finite generation method,” in: Y. Ermoliev and R.J.-B. Wets, eds.,Numerical Techniques for Stochastic Programming Problems (Springer, Berlin, 1988).
K.C. Kiwiel, Methods of Descent for Nondifferentiable Optimization,Lecture Notes in Mathematics, Vol. 1133 (Springer, Berlin, 1985).
Y.Y. Lin and J.-S. Pang, “Iterative methods for large convex quadratic programs: a survey,”SIAM Journal on Control and Optimization 25 (1987) 383–411.
R.C. Monteiro and I. Adler, “An O(n 3 L) interior point algorithm for convex quadratic programming,” preprint.
W. Oettli, “Decomposition schemes for finding saddle points of quasi-convex-concave functions,” preprint.
J.-S. Pang, “Methods for quadratic programming: a survey,”Computers and Chemical Engineering 7 (1983) 583–594.
R.T. Rockafellar, “Linear-quadratic programming and optimal control,”SIAM Journal on Control and Optimization 25 (1987) 781–814.
R.T. Rockafellar and R.J.-B. Wets, “A Lagrangian finite-generation technique for solving linear-quadratic problems in stochastic programming,”Mathematical Programming Studies 28 (1986) 63–93.
R.T. Rockafellar and R.J.-B. Wets, “Linear-quadratic problems with stochatic penalties: the finite generation algorithm,” in: V.I. Arkin, A. Shiraev and R.J.-B. Wets, eds.,Stochastic Optimization, Lecture Notes in Control and Information Sciences, 81 (Springer, Berlin, 1987) pp. 545–560.
R.T. Rockafellar and R.J.-B. Wets, “Generalized linear-quadratic problems of deterministic and stochastic optimal control in discrete time,”SIAM Journal on Control and Optimization, to appear.
R.T. Rockafellar, “Monotone operators and the proximal point algorithm,”SIAM Journal on Control and Optimization 14 (1976) 877–898.
R.T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming,”Mathematics of Operations Research 1 (1976) 97–116.
R.T. Rockafellar, “Lagrange multipliers and variational inequalities,” in: [1] pp. 303–322.
R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
J.M. Wagner, “Stochastic programming with recourse applied to groundwater quality management,” Doctoral Dissertation, MIT (Cambridge, MA, 1988).
Y. Ye and E. Tse, “A polynomial-time algorithm for convex quadratic programming,” preprint.
C. Zhu and R.T. Rockafellar, “Finite-envelope gradient projection methods for extended linear-quadratic programming,” preprint.
Author information
Authors and Affiliations
Additional information
This work was supported in part by grants AFOSR 87-0821 and AFOSR 89-0081 from the Air Force Office of Scientific Research.
Rights and permissions
About this article
Cite this article
Rockafellar, R.T. Computational schemes for large-scale problems in extended linear-quadratic programming. Mathematical Programming 48, 447–474 (1990). https://doi.org/10.1007/BF01582268
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582268