A Class of penalty functions for optimization problema with bound constraints

References

• Bartles , R.H. 1980 . A penalty linear programming method using reduced-gradient basisexchange techniques . Linear Algebra and its Applications , 29 : 17 – 32 .
   Google Scholar
• Bertsekas , D.P. 1976 . On the Goldstein-Levitin-Polyak gradient projection method . IEEE Transactions on Automatic Control , 21 : 174 – 184 .
   Web of Science ®Google Scholar
• Bertsekas , D.P. 1982 . Projected Newton methods for optimization problems with simple constraints . SlAM Journal on Control and Optimization , 20 : 221 – 246 .
   Web of Science ®Google Scholar
• Burke , J.V. and Moré , J.J. 1988 . On the identification of active constraints . SlAM Journal on Numerical Analysis , 25 : 1197 – 1211 .
   Web of Science ®Google Scholar
• Calamai , P.H. and Moré , J.J. 1987 . Projected gradient methods for linearly constrained problems . Mathematical Programming , 39 : 93 – 116 .
   Web of Science ®Google Scholar
• Coleman , T.F. and Hulbert , L.A. 1989 . A direct active set algorithm for large sparse quadratic programs with simple bounds . Mathematical Programming, Series B , 45 : 373 – 406 .
   Google Scholar
• Conn , A.R. 1976 . Linear programming via a nondifferentiable penalty function . SIAM Journal on Numerical Analysis , 13 : 760 – 784 .
   Google Scholar
• Conn , A.R. , Gould , N.I.M. and Toint , Ph. 1988 . Global convergence of a class of trust region algorithms for optimization problems with simple bounds . SIAM Journal on Numerical Analysis , 25 : 433 – 460 .
   Web of Science ®Google Scholar
• Conn , A.R. , Gould , N.I.M. and Toint , Ph. 1988 . Testing a class of methods for solving minimization problems with simple bounds on the variables . Mathematics of computation , 50 : 399 – 430 .
   Web of Science ®Google Scholar
• Cottle , R.W. and Goheen , M.S. 1978 . “ A special class of large quadratic programs ” . In Nonlinear Programming 3 , Edited by: Mangasarian , O.L. , Meyer , R.R. and Robinson , S.M. 361 – 390 . New York : Academic Press .
   Google Scholar
• Dembo , R.S. and Tulowitzki , U. 1983 . On the minimization of quadratic functions subject to box constraints , New Haven : Yale University . Working Paper, Series B, no. 71, School of Organization and Management
   Google Scholar
• Di Pillo , G. and Grippo , L. 1986 . An exact penalty method with global convergence properties for nonlinear programming problems . Mathematical Programming , 36 : 1 – 18 .
   Google Scholar
• Di Pillo , G. and Grippo , L. 1989 . Exact penalty in constrained optimization . SIAM Journal on Control and Optimization , 27 : 1333 – 1360 .
   Web of Science ®Google Scholar
• Dunn , J.C. 1981 . Global and asymptotic convergence rate estimates for a class of projected gradient processes . SIAM Journal on Control and Optimization , 19 : 368 – 400 .
   Google Scholar
• Facchinei , F. and Lucidi , S. 1990 . A class of methods for optimization problem with simple bounds Roma, , Italy Part 1. IASI-CNR Tech. Rep. 313
   Google Scholar
• Facchinei , F. 1992 . A class of methods for optimization problem with simple bounds Roma, , Italy Part 2. IASI-CNR Tech. Rep. 313
   Google Scholar
• Fiacco , A.V. and McCormick , G.P. 1968 . Nonlinear programming sequential unconstrained minimization techniques , New York : John Wiley .
   Google Scholar
• Freund , R.M. 1989 . Theoretical efficiency of a shifted function algorithm for linear programming Cambridge, Massachusetts Sloan, W. P., 3002-89-MS, Massachusetts Institute of Technology
   Google Scholar
• Gill , P.E. , Murray , W. , Saunders , A. , Tomlin , J.A. , Wright , M.H. , Gill , P.E. , Murray , W. and Wright , M.H. 1981 . Practical Optimization , London : Academic Press .
   Google Scholar
• Gill , P.E. , Murray , W. and Wright , M.H. 1981 . Practical Optimization , London : Academic Press .
   Google Scholar
• Gamble , A.B. , Conn , A.R. and Pulleyblank , W.R. 1991 . A network penalty method . Mathematical programming , 50 : 53 – 73 .
   Google Scholar
• Grippo , L. and Lucidi , S. 1991 . On the solution of a class of quadratic programs using a differentiable exact penalty function . Optimization , 22 : 557 – 578 .
   Google Scholar
• Hestenes , M.R. 1975 . Optimization Theory. The Finite Dimensional Case , New York : John Wiley .
   Google Scholar
• Hiriart-Urruty , J.B. , Strodiot , J.J. and Nguyen , V.H. 1984 . Generalized hessian matrix and second-order optimality conditions for problem with C1,1 data . Applied Mathematics Optimization , 11 : 43 – 56 .
   Web of Science ®Google Scholar
• Júdice , J.J. and Pires , F.M. 1989 . Direct methods for convex quadratic programs subject to box constraints , Coimbra, , Portugal : Universidade de Coimbra . Preprint
   Google Scholar
• Karmarkar , N. 1984 . A new polynomial-time algorithm for linear programming . Combinatorica , 4 : 373 – 395 .
   Web of Science ®Google Scholar
• Lin , Y.Y. and Pang , J.S. 1987 . Iterative methods for large convex quadratic programs: A survey . SIAM J. on Control and Optimization , 25 : 383 – 411 .
   Google Scholar
• Lötsted , P. 1984 . Solving the minimal least square problems subject to bounds on the constraints . BIT , 24 : 206 – 224 .
   Google Scholar
• Moré , J.J. and Toraldo , G. 1989 . Algorithms for bound constrained quadratic programming problems . Numerische Mathematik , 55 : 377 – 400 .
   Web of Science ®Google Scholar
• Moré , J.J. and Toraldo , G. 1991 . Numerical solution of large quadratic programming problems with bound constraints . SIAM Journal on Optimization , 1 : 93 – 113 .
   Web of Science ®Google Scholar
• O’Leary , D.P. 1980 . A generalized conjugate gradient algorithm for solving a class of quadratic programming problems . Linear Algebra Appl. , 34 : 371 – 399 .
   Web of Science ®Google Scholar
• Wright S.J. Algorithms for minimization subject to bounds Algonne National Laboratory 1988 Preprint MCS-P32-1288
   Google Scholar
• Yang , E.K. and Tolle , J.W. 1988 . “ University of North Carolina, Department of Operations Research preprint ” . In A class of methods for solving large convex quadratic programs subject to box constraints , North Carolina : Chapell Hill .
   Google Scholar