Differentiable piecewise quadratic exact penalty functions for quadratic programs with simple bound constraints

SIAM Journal on Optimization

Volumn 6, Issue 2, 1996, Pages 299-315

  Li, Wu ^a  

^a OLD DOMINION UNIVERSITY   (United States)

Author keywords

(isolated) local solutions; Differentiable exact penalty functions; Global solutions; Quadratic programs with simple bound constraints; Quadratic splines

Indexed keywords

EID: 0030303843     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/0806017     Document Type: Article

References (52)

1. D. P. BERTSEKAS, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
2. _, Projected Newton methods for optimization methods for optimization problems with simple bounds, SIAM J. Control Optim., 20 (1982), pp. 221-246.
3. A. BJÖRCK, A direct method for sparse least squares problems with lower and upper bounds, Numer. Math., 54 (1988), pp. 19-32.
4. T. F. COLEMAN AND L. A. HULBERT, A direct active set algorithm for large sparse quadratic programs with simple bounds, Math. Programming, 45 (1990), pp. 180-201.
5. _, A globally and superlinearly convergent algorithm for convex quadratic programs with simple bounds, SIAM J. Optim., 3 (1993), pp. 298-321.
6. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM J. Numer. Anal., 25 (1988), pp. 433-460.
7. _, Testing a class of methods for solving minimization problems with simple bounds on the variables, Math. Comput., 50 (1988), pp. 399-430.
8. R. W. COTTLE AND M. S. GOHEEN, A special class of large quadratic programs, in Nonlinear Programming 3, O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, eds., Academic Press, New York, 1978.
9. R. W. COTTLE, G. H. GOLUB, AND R. S. SACHER, On the solution of large, structured linear complementarity problems: The block partitioned case, Appl. Math. Optim., 4 (1978), pp. 347-363.
10. R. W. COTTLE, J.-S. PANG, AND R. E. STONE, The Linear Complementarity Problem, Academic Press, Boston, 1992.
11. A. DAX, On computational aspects of bounded linear least squares problems, ACM Trans. Math. Software, 17 (1991), pp. 64-73.
12. M. A. DIAMOND, The solution of a quadratic programming problem using fast methods to solve systems of linear equations, Internat. J. Systems Sci., 5 (1974), pp. 131-136.
13. G. DI PILLO AND L. GRIPPO, Exact penalty functions in constrained optimization, SIAM J. Control Optim., 27 (1989), pp. 1333-1360.
14. F. FACCHINEI AND S. LUCIDI, A class of penalty functions for optimization problems with bound constraints, Optimization, 26 (1992), pp. 239-259.
15. R. FLETCHER, A class of methods for nonlinear programming with termination and convergence properties, in Integer and Nonlinear Programming, J. Abadie, ed., North-Holland, Amsterdam, 1970, pp. 157-173.
16. R. FLETCHER AND M. P. JACKSON, Minimization of a quadratic function of many variables subject to only lower and upper bounds, J. IMA, 14 (1974), pp. 159-174.
17. M. FRANK AND P. WOLFE, An algorithm for quadratic programming, Naval Res. Logist., 3 (1956), pp. 95-110.
18. A. FRIEDLANDER AND J. M. MARTÍNEZ, On the maximization of a concave quadratic function with box constraints, SIAM J. Optim., 4 (1994), pp. 177-192.
19. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, The John Hopkins University Press, Baltimore, MD, 1983.
20. L. GRIPPO AND S. LUCIDI, A differentiable exact penalty function for bound constrained quadratic programming problems, Optimization, 22 (1991), pp. 557-578.
21. _, On the solution of a class of quadratic programs using a differentiable exact penalty function, in System Modelling and Optimization (Leipzig, 1989), H. J. Sebastian and K. Tammer, eds., Lecture Notes in Control and Inform. Sci., 143, Springer-Verlag, Berlin, 1990, pp. 764-773.
22. C.-H. HAN, P. M. PARDALOS, AND Y. YE, Computational aspects of an interior point algorithm for quadratic programming problems with box constraints, in Large-scale Numerical Optimization, Thomas F. Coleman and Yuying Li, eds., Society for Industrial and Applied Mathematics, Philadelphia, PA, 1990, pp. 92-112.
23. _, An interior point algorithm for large-scale quadratic problems with box constraints, Springer-Verlag Lecture Notes in Control and Information, Vol. 144, A. Bensoussan and J. L. Lions, eds., 1990, pp. 413-422.
24. _, On the solution of indefinite quadratic problems using an interior point algorithm, Informatica, 3 (1992), pp. 474-496.
25. S. P. HAN AND O. L. MANGASARIAN, Exact penalty functions in nonlinear programming, Math. Programming, 17 (1979), pp. 251-269.
26. M. R. HESTENES, Multiplier and gradient methods, in Computing Methods in Optimization Problems - 2, L. A. Zadeh, L. W. Neustadt, and A. V. Balakrishnan, eds., Academic Press, New York, 1969, pp. 143-164.
27. _, Multiplier and gradient methods, J. Optim. Theory Appl., 4 (1969), pp. 303-320.
28. J. J. JÚDICE AND F. M. PIRES, Bard-type methods for the linear complementarity problem with symmetric positive definite matrices, IMA J. Math. Appl. Bus. Indust., 2 (1989), pp. 51-68.
29. W. LI, Linearly convergent descent methods for unconstrained minimization of a convex quadratic spline, J. Optim. Theory Appl., 86 (1995), pp. 145-172.
30. _, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, Math. Programming, to appear.
31. _, Differentiable piecewise quadratic penalty functions for quadratic programs via Hestenes-Powell-Rockafellar's augmented Lagrangian function, Department of Mathematics and Statistics, Old Dominion University, Norfolk, VA, April 1994, revised July 1995, manuscript.
32. W. LI AND J. SWETITS, A Newton method for convex regression, data smoothing, and quadratic programming with bounded constraints, SIAM J. Optim., 3 (1993), pp. 466-488.
33. _, A new algorithm for solving strictly convex quadratic programs, Tech. report TR92-1, Department of Mathematics and Statistics, Old Dominion University, Norfolk, VA, Nov. 1992, SIAM J. Optim., submitted.
34. Y. LIN AND C. W. CRYER, An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems, Appl. Math. Optim., 13 (1985), pp. 1-17.
35. Y. Y. LIN AND J.-S. PANG, Iterative methods for large convex quadratic programs: A survey, SIAM J. Control Optim., 25 (1987), pp. 383-411.
36. P. LOTSTEDT, Solving the minimal least squares problem subject to bounds on the variables, BIT, 24 (1984), pp. 206-224.
37. A. MAJTHAY, Optimality conditions for quadratic programming, Math. Programming, 1 (1971), pp. 359-365.
38. O. L. MANGASARIAN, Solution of symmetric linear complementarity problems by iterative methods, J. Optim. Theory Appl., 22 (1977), pp. 465-485.
39. _, Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems, Math. Programming, 19 (1980), pp. 200-212.
40. G. P. MCCORMICK, Second order conditions for constrained minima, SIAM J. Appl. Math., 15 (1967), pp. 641-652.
41. J. J. MORÉ AND G. TORALDO, Algorithms for bound constrained quadratic programming problems, Numer. Math., 55 (1989), pp. 377-400.
42. _, On the solutions of large quadratic programming problems with bound constraints, SIAM J. Optim., 1 (1991), pp. 93-113.
43. D. P. O'LEARY, A generalized conjugate gradient algorithm for solving a class of quadratic programming problems, Linear Algebra Appl., 34 (1980), pp. 371-399.
44. P. M. PARDALOS, C. G. HAN, AND Y. YE, Interior-point algorithms for solving nonlinear optimization problems, Math. Progr. Society, COAL Newsletter, 19 (1991), pp. 45-54.
45. _, An interior-point algorithm for large-scale quadratic problems with box constraints, in Analysis and Optimization of Systems, A. Bensoussan and J. L. Lions, eds., Lecture Notes in Control and Inform. Sci., 144, Springer-Verlag, New York, 1990, pp. 413-422.
46. M. J. D. POWELL, A method for nonlinear constraints in minimization problems, in Optimization, R. Fletcher, ed., Academic Press, New York, 1972, pp. 283-298.
47. R. T. ROCKAFELLAR, New applications of duality in convex programming, in Proc. Confer. Probab. 4th, Brasov, Romania, 1971, pp. 73-81.
48. _, The multiplier method of Hestenes and Powell applied to convex programming, J. Optim. Theory Appl., 12 (1973), pp. 555-562.
49. _, A dual approach to solving nonlinear programming problems by unconstrained optimization, Math. Programming, 5 (1973), pp. 354-573.
50. A. STACHURSKI, Monotone sequences of feasible solutions for quadratic programming problems with M-matrices and box constraints, in System Modelling and Optimization (Budapest, 1985), A. Prekopa, J. Szelezsan, and B. Strazicky, eds., Lecture Notes in Control and Inform. Sci., 84, Springer-Verlag, New York, 1985, pp. 896-902.
51. P. TSENG, D. P. BERTSEKAS, AND J. N. TSITSIKLIS, Partially asynchronous, parallel algorithms for network flow and other problems, SIAM J. Control Optim., 28 (1990), pp. 678-710.
52. E. K. YANG AND J. W. TOLLE, A class of methods for solving large, convex quadratic programs subject to box constraints, Math. Programming, 51 (1991), pp. 223-228.