Newton's method and quasi-Newton-SQP method for general LC1 constrained optimization

Applied Mathematics and Computation

Volumn 92, Issue 1, 1998, Pages 69-84

  Sun, Wenyu ^a,b  

^a NANJING UNIVERSITY   (China)

^b FEDERAL UNIVERSITY OF PARANÁ   (Brazil)

Author keywords

Newton method; Non smooth optimization; Optimality condition; Quasi Newton method; SQP method

Indexed keywords

EID: 0142207506     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(97)10053-4     Document Type: Article

References (18)

1. J.S. Pang, Newton's method for B-differentiable equations, Math. Oper. Res. 15 (1990) 311-341.
2. 1 optimization problems. Math. Programming 60 (1994).
3. L. Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res. 18 (1993) 227-244.
4. R.T. Rockafellar, Computational schemes for solving large-scale problems in extended linearquadratic programming. Math. Programming 48 (1990) 447-474.
5. R.T. Rockafellar, R.J.-B. Wets, Generalized linear-quadratic problems of deterministic and stochastic optimal control in discrete time, SIAM J. Control Optim. 28 (1990) 810-822.
6. 1 unconstrained optimization. J. Comput. Math. 13 (1995) 250-258.
7. C.G. Broyden, J.E. Dennis, J.J. More, On the local and superlinear convergence of quasi-Newton methods, J. Inst. Math. Appl. 12 (1973) 223-245.
8. J.E. Dennis, J.J. More, A characterization of superlinear convergence and its application to quasi-Newton methods. Math. Comp. 28 (1974) 549-560.
9. A. Ben-Tal, Second-order and related extremality conditions in nonlinear programming, J. Optim. Theory Appl. 31 (1980) 143-165.
10. R.W. Chaney, Second order necessary conditions in semismooth optimization, J. Optim. Theory Appl. 47 (1985) 483-490.
11. R.W. Chaney, Second order sufficient condition in nonsmooth optimization, Math. Oper. Res. 13 (1988) 660-673.
12. F.H. Clarke, Optimization and Nonsmooth Analysis, Wiley, New York, 1983.
13. W. Sun, Y. Yuan, Optimization Theory and Methods, Science Press, Beijing, 1996.
14. 1.1 data, Appl. Math. Optim. 11 (1984) 43-56.
15. J.S. Pang, A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems. Math. Programming 51 (1991) 101-131.
16. S.P. Han, Superlinearly convergent variable metric algorithms for general nonlinear programming problems, Math. Programming 11 (1976) 263-282.
17. M.J.D. Powell, A fast algorithm for nonlinearly constrained optimization calculation, in: G.A. Watson (Ed.), Numerical Analysis, Lecture Notes in Mathematics, vol. 630, Springer, Berlin, 1978.
18. L. Qi, W. Sun, An iterative method for minimax problem, in: D.Z. Du, P.M. Pardalos (Eds.), Minimax and Applications, Kluwer Academic Publisher, Boston, 1995, pp. 55-67.