A note on the convergence of barrier algorithms to second-order necessary points

Mathematical Programming, Series B

Volumn 85, Issue 2, 1999, Pages 433-438

  Gould, Nicholas I M ^a   Toint, Philippe L ^b  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^b UNIVERSITY OF NAMUR   (Belgium)

Author keywords

Barrier algorithms; Constrained optimization; Second order points

Indexed keywords

EID: 0037572858     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050066     Document Type: Article

References (21)

1. Auslender, A. (1979): Penalty methods for computing points that satisfy second order necessary points. Math. Program. 17(2), 229-238
2. Bannert, T. (1994): A trust region algorithm for nonsmooth optimization. Math. Program. 67(2), 247-264
3. Bonnans, J.F., Launay, G. (1995): Sequential quadratic-programming with penalization of the displacement. SIAM J. Optim. 5(4), 792-812
4. Borwein, J.M. (1982): Necessary and sufficient conditions for quadratic minimality. Numer. Funct. Anal. Optim. 5, 127-140
5. Contesse, L.B. (1980): Une caractérisation complète des minima locaux en programmation quadratique. Numer. Math. 34, 315-332
6. Facchinei, F., Lucidi, S. (1996): Convergence to second order stationary points in inequality constrained optimization. Technical Report 32-96. University of Rome "La Sapienza", Rome
7. Fiacco, A.V., McCormick, G.P. (1990): Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, New York, 1968.
8. Reprinted as Classics in Applied Mathematics 4. SIAM
9. Fletcher, R. (1981): Practical Methods of Optimization: Constrained Optimization. Wiley, New York
10. Gay, D.M. (1984): A Trust Region Approach to Linearly Constrained Optimization. In: Griffiths, D.F., ed., Numerical Analysis: Proceedings Dundee 1983, pp.72-105, Lect. Notes Math. 1066. Springer, Berlin
11. Gill, P.E., Murray, W., Wright, M.H. (1981): Practical Optimization. Academic Press, London, New York
12. Gould, F.J., Tolle, J.W. (1972): Geometry of optimality conditions and constraint qualifications. Math. Program. 2(1), 1-18
13. Mangasarian, O.L. (1979): Nonlinear Programming. McGraw-Hill, New York
14. McCormick, G.P. (1977): A modification of Armijo's step-size rule for negative curvature. Math. Program. 13(1), 111-115
15. Moré, J.J. (1983): Recent Developments in Algorithms and Software for Trust Region Methods. In: Bachern, A., Grötschel, M., Korte, B., eds., Mathematical Programming, The State of the Art, pp. 258-287. Springer, Berlin
16. Moré, J.J., Sorensen, D.C. (1979): On the use of directions of negative curvature in a modified Newton method. Math. Program. 16(1), 1-20
17. Murty, K.G., Kabadi, S.N. (1987): Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39(2), 117-129
18. Shultz, G.A., Schnabel, R.B., Byrd, R.H. (1985): A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties. SIAM J. Numer. Anal. 22(1), 47-67
19. Vavasis, S.A. (1992): Nonlinear Optimization: Complexity Issues. Number 8 in International Series of Monographs on Computer Science. Oxford University Press, Oxford, Great Britain
20. Vincente, L. (1995): Trust-Region Interior-Point Algorithms for a Class of Nonlinear Programming Problems. PhD thesis. Department of Computational and Applied Mathematics, Rice University, Houston, Texas, USA. Report TR96-05
21. Wright, S.J. (1997): Primal-Dual Interior-Point Methods. SIAM, Philadelphia, USA