article

Algorithms for bound constrained quadratic programming problems

Authors:

Jorge J. Moré and

Gerardo ToraldoAuthors Info & Claims

Numerische Mathematik, Volume 55, Issue 4

Pages 377 - 400

https://doi.org/10.1007/BF01396045

Published: 01 July 1989 Publication History

Abstract

We present an algorithm which combines standard active set strategies with the gradient projection method for the solution of quadratic programming problems subject to bounds. We show, in particular, that if the quadratic is bounded below on the feasible set then termination occurs at a stationary point in a finite number of iterations. Moreover, if all stationary points are nondegenerate, termination occurs at a local minimizer. A numerical comparison of the algorithm based on the gradient projection algorithm with a standard active set strategy shows that on mildly degenerate problems the gradient projection algorithm requires considerable less iterations and time than the active set strategy. On nondegenerate problems the number of iterations typically decreases by at least a factor of 10. For strongly degenerate problems, the performance of the gradient projection algorithm deteriorates, but it still performs better than the active set method.

References

[1]

Barlow, R.E., Bartholomew, J.M., Brenner, J.M., Brunk, H.D.: Statistical inference under order restrictions, 1st Ed. New York: Wiley 1972.

[2]

Bertsekas, D.P.: On the Goldstein-Levitin-Polyak gradient projection method. IEEE Trans. Autom. Control. 21, 174-184 (1976).

[3]

Bertsekas, D.P.: Projected Newton methods for optimization problems with simple constraints. SIAM J. Control. Optimization 20, 221-246 (1982).

[4]

Björck, A.: A direct method for sparse least squares problems with lower and upper bounds. Numer. Math. 54, 19-32 (1988).

Digital Library

[5]

Brucker, P.: An O(n) algorithm for quadratic knapsack problems. Oper. Res. Lett. 3, 163-166 (1984).

Digital Library

[6]

Burke, J.V., Moré, J.J.: On the identification of active constraints. SIAM J. Numer. Anal. 25, 1197- 1211 (1988).

Digital Library

[7]

Calamai, P.H., Moré, J.J.: Projected gradient methods for linearly constrained problems. Math. Programming 39, 93-116 (1987a).

Digital Library

[8]

Calamai, P.H., Moré, J.J.: Quasi-Newton updates with bounds. SIAM J. Numer. Anal. 24, 1434-1441 (1987b).

Digital Library

[9]

Clark, D.I., Osborne, M.R.: On linear restricted and interval least squares problems. IMA J. Numer. Anal. 8, 23-36 (1988).

[10]

Cottle, R.W., Goheen, M.S.: A special class of large quadratic programs. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming 3, pp. 361-390. London: Academic Press 1978.

[11]

Dembo, R.S., Tulowitzki, U.: On the minimization of quadratic functions subject to box constraints, Working Paper Series B #71, School of Organization and Management, Yale University, New Haven 1983.

[12]

Dongarra, J.J., Bunch, J.R., Moler, C.B., Stewart, G.W.: LINPACK Users Guide, SIAM Publications, Philadelphia 1979.

[13]

Dunn, J.C.: Global and asymptotic convergence rate estimates for a class of projected gradient processes, SIAM J. Control Optimization 19, 368-400 (1981).

[14]

Dunn, J.C.: On the convergence of projected gradient processes to singular critical points. J. Optimization Theory Appl. 55, 203-216 (1987).

Digital Library

[15]

Glowinski, R.: Numerical methods for nonlinear variational problems, 1st Ed. Heidelberg Berlin New York: Springer 1984.

[16]

Grotzinger, S.J., Witzgall, C.: Projections onto order simplexes. Appl. Math. Optimization 12, 247-270 (1984).

[17]

Helgason, R., Kennington, J., Lall, H.: A polynomially bounded algorithm for a single constrained quadratic program. Math. Program. Study 18, 338-343 (1980).

[18]

Lin, Y., Cryer, C.W.: An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems. J. Appl. Math. Optimization 13, 1-17 (1985).

[19]

Lin, Y.Y., Pang, J.S.: Iterative methods for large convex quadratic programs: A survey. SIAM J. Control. Optimization 25, 383-411 (1987).

Digital Library

[20]

Lötstedt, P.: Solving the minimal least squares problem subject to bounds on the variables. BIT 24, 206-224 (1984).

[21]

Mangasarian, O.L.: Normal solutions of linear programs. Math. Program. Study 21, 206-213 (1984).

[22]

Moré, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Statist. Comput. 4, 553-572 (1983).

Digital Library

[23]

O'Leary, D.P.: A generalized conjugate gradient algorithm for solving a class of quadratic programming problems. Linear Algebra Appl. 34, 371-399 (1980).

[24]

Oreborn, U.: A direct method for sparse nonnegative least squares problems, Department of Mathematics, Thesis 87. Linköping University, Linköping, Sweden 1986.

[25]

Yang, E.K., Tolle, J.W.: A class of methods for solving large convex quadratic programs subject to box constraints, University of North Carolina, Department of Operations Research preprint, Chapel Hill, North Carolina 1988.

Cited By

Cristofari ADe Santis MLucidi SRinaldi F(2022)Minimization over the -ball using an active-set non-monotone projected gradientComputational Optimization and Applications10.1007/s10589-022-00407-683:2(693-721)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1007/s10589-022-00407-6
Vu MHartl-Nesic CKugi A(2021)Fast Swing-Up Trajectory Optimization for a Spherical Pendulum on a 7-DoF Collaborative Robot2021 IEEE International Conference on Robotics and Automation (ICRA)10.1109/ICRA48506.2021.9561093(10114-10120)Online publication date: 30-May-2021
https://dl.acm.org/doi/10.1109/ICRA48506.2021.9561093
Cristofari ADe Santis MLucidi SRinaldi F(2020)An active-set algorithmic framework for non-convex optimization problems over the simplexComputational Optimization and Applications10.1007/s10589-020-00195-x77:1(57-89)Online publication date: 16-May-2020
https://dl.acm.org/doi/10.1007/s10589-020-00195-x
Show More Cited By

Index Terms

Algorithms for bound constrained quadratic programming problems

Index terms have been assigned to the content through auto-classification.

Recommendations

Convergence-order analysis of branch-and-bound algorithms for constrained problems

The performance of branch-and-bound algorithms for deterministic global optimization is strongly dependent on the ability to construct tight and rapidly convergent schemes of lower bounds. One metric of the efficiency of a branch-and-bound algorithm is ...
Read More
On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems

We consider the class of quadratically-constrained quadratic-programming methods in the framework extended from optimization to more general variational problems. Previously, in the optimization case, Anitescu (SIAM J. Optim. 12, 949---978, 2002) ...
Read More
A pointwise quasi-Newton method for unconstrained optimal control problems

For a class of unconstrained optimal control problems we propose a quasi-Newton method that exploits the structure of the problem. We define a new type of superlinear convergence for sequences in function spaces and prove superlinear convergence of the ...
Read More

Comments

Information & Contributors

Information

Published In

cover image Numerische Mathematik

Numerische Mathematik Volume 55, Issue 4

July 1989

114 pages

ISSN:0029-599X

Issue’s Table of Contents

Copyright © Copyright © 1989 Springer-Verlag.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 July 1989

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

39
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Cristofari ADe Santis MLucidi SRinaldi F(2022)Minimization over the -ball using an active-set non-monotone projected gradientComputational Optimization and Applications10.1007/s10589-022-00407-683:2(693-721)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1007/s10589-022-00407-6
Vu MHartl-Nesic CKugi A(2021)Fast Swing-Up Trajectory Optimization for a Spherical Pendulum on a 7-DoF Collaborative Robot2021 IEEE International Conference on Robotics and Automation (ICRA)10.1109/ICRA48506.2021.9561093(10114-10120)Online publication date: 30-May-2021
https://dl.acm.org/doi/10.1109/ICRA48506.2021.9561093
Cristofari ADe Santis MLucidi SRinaldi F(2020)An active-set algorithmic framework for non-convex optimization problems over the simplexComputational Optimization and Applications10.1007/s10589-020-00195-x77:1(57-89)Online publication date: 16-May-2020
https://dl.acm.org/doi/10.1007/s10589-020-00195-x
Crisci SKružík JPecha MHorák (2020)Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programmingSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-020-05304-w24:23(17761-17770)Online publication date: 1-Dec-2020
https://dl.acm.org/doi/10.1007/s00500-020-05304-w
Rahpeymaii FKimiaei MBagheri A(2016)A limited memory quasi-Newton trust-region method for box constrained optimizationJournal of Computational and Applied Mathematics10.1016/j.cam.2016.02.026303:C(105-118)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1016/j.cam.2016.02.026
De Asmundis Rdi Serafino DLandi G(2016)On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problemsJournal of Computational and Applied Mathematics10.1016/j.cam.2016.01.007302:C(81-93)Online publication date: 15-Aug-2016
https://dl.acm.org/doi/10.1016/j.cam.2016.01.007
Gospodarczyk PWoźny P(2016)Merging of Bézier curves with box constraintsJournal of Computational and Applied Mathematics10.1016/j.cam.2015.10.005296:C(265-274)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1016/j.cam.2015.10.005
De Asmundis RDi Serafino DHager WToraldo GZhang H(2014)An efficient gradient method using the Yuan steplengthComputational Optimization and Applications10.1007/s10589-014-9669-559:3(541-563)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1007/s10589-014-9669-5
Chen HSchmeiser B(2013)I-SMOOTHINFORMS Journal on Computing10.1287/ijoc.1120.051225:3(432-445)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1287/ijoc.1120.0512
Jiang LLi JLuo SWest SPlatt G(2012)Power load event detection and classification based on edge symbol analysis and support vector machineApplied Computational Intelligence and Soft Computing10.1155/2012/7424612012(27-27)Online publication date: 1-Jan-2012
https://dl.acm.org/doi/10.1155/2012/742461
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents