메뉴 건너뛰기




Volumn 23, Issue 3, 1998, Pages 746-766

Convergence to second order stationary points in inequality constrained optimization

Author keywords

Inequality constrained optimization; KKT second order necessary conditions; LC1 function; Negative curvature direction; Penalty function

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; NONLINEAR PROGRAMMING; PROBLEM SOLVING;

EID: 0032131216     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.3.746     Document Type: Article
Times cited : (26)

References (29)
  • 1
    • 0018523346 scopus 로고
    • Penalty methods for computing points that satisfy second order necessary conditions
    • Auslender, A. 1979, Penalty methods for computing points that satisfy second order necessary conditions. Math. Programming 17 229-238.
    • (1979) Math. Programming , vol.17 , pp. 229-238
    • Auslender, A.1
  • 3
    • 0023430609 scopus 로고
    • A trust region algorithm for nonlinearly constrained optimization
    • Byrd, R. H., R. B. Schnabel, G. A. Shultz. 1987. A trust region algorithm for nonlinearly constrained optimization. SIAM J. Numerical Analysis 24 1152-1170.
    • (1987) SIAM J. Numerical Analysis , vol.24 , pp. 1152-1170
    • Byrd, R.H.1    Schnabel, R.B.2    Shultz, G.A.3
  • 5
    • 0030303844 scopus 로고    scopus 로고
    • An interior trust region approach for nonlinear minimization subject to bounds
    • Coleman, T. F., Y. Li. 1996. An interior trust region approach for nonlinear minimization subject to bounds. SIAM J. Optimization 6 418-445.
    • (1996) SIAM J. Optimization , vol.6 , pp. 418-445
    • Coleman, T.F.1    Li, Y.2
  • 7
    • 0002467356 scopus 로고
    • Global convergence of a class of trust region algorithms for optimization with simple bounds
    • Conn, A. R., N. I M. Gould, Ph. L. Toint 1988. Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numerical Analysis 25 433-460
    • (1988) SIAM J. Numerical Analysis , vol.25 , pp. 433-460
    • Conn, A.R.1    Gould, N.I.M.2    Toint, Ph.L.3
  • 8
    • 0027677735 scopus 로고
    • A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set
    • Contaldi, G., G. Di Pillo, S. Lucidi. 1993. A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set. Oper. Res. Letters 14 153-161.
    • (1993) Oper. Res. Letters , vol.14 , pp. 153-161
    • Contaldi, G.1    Di Pillo, G.2    Lucidi, S.3
  • 10
    • 0002316369 scopus 로고
    • Exact penalty methods
    • E. Spedicato, ed. NATO ASI Series Kluwer Academic Publishers, Dordrecht
    • Di Pillo, G 1994. Exact penalty methods. E. Spedicato, ed. Algorithms for Continuous Optimization. NATO ASI Series Vol. 434. Kluwer Academic Publishers, Dordrecht, 209-253.
    • (1994) Algorithms for Continuous Optimization , vol.434 , pp. 209-253
    • Di Pillo, G.1
  • 11
    • 0021316963 scopus 로고
    • A class of continuously differentiable exact penalty function algorithms for nonlinear programming problems P
    • Toft Christensen, ed. Springer Verlag, Berlin
    • _, L. Grippo. 1984. A class of continuously differentiable exact penalty function algorithms for nonlinear programming problems P. Toft Christensen, ed. System Modelling and Optimization. Springer Verlag, Berlin, 246-256.
    • (1984) System Modelling and Optimization , pp. 246-256
    • Grippo, L.1
  • 12
    • 0021794572 scopus 로고
    • A continuously differentiable exact penalty function for nonlinear programming problems with inequalty constraints
    • _, _. 1985. A continuously differentiable exact penalty function for nonlinear programming problems with inequalty constraints. SIAM J. Control Optim. 23 72-84.
    • (1985) SIAM J. Control Optim. , vol.23 , pp. 72-84
  • 13
    • 0024768569 scopus 로고
    • Exact penalty functions in constrained optimization
    • _. _. 1989 Exact penalty functions in constrained optimization. SIAM J. Control Optim. 27 1333-1360.
    • (1989) SIAM J. Control Optim. , vol.27 , pp. 1333-1360
  • 15
    • 0032244001 scopus 로고    scopus 로고
    • On the accurate identification of active constraints
    • to appear.
    • Facchinei, F., A. Fischer, C. Kanzow. to appear. On the accurate identification of active constraints. SIAM J. Optim.
    • SIAM J. Optim.
    • Facchinei, F.1    Fischer, A.2    Kanzow, C.3
  • 17
    • 0030243966 scopus 로고    scopus 로고
    • Nonmonotone curvilinear line search methods for unconstrained optimization
    • Ferris, M. C., S. Lucidi, M. Roma. 1996. Nonmonotone curvilinear line search methods for unconstrained optimization. Computational Optim. Appl. 6 117-136.
    • (1996) Computational Optim. Appl. , vol.6 , pp. 117-136
    • Ferris, M.C.1    Lucidi, S.2    Roma, M.3
  • 18
    • 0031542934 scopus 로고    scopus 로고
    • Newton methods for large-scale linear inequality constrained minimization
    • Forsgren, A., W. Murray. 1997. Newton methods for large-scale linear inequality constrained minimization. SIAM J. Optim. 7 162-176.
    • (1997) SIAM J. Optim. , vol.7 , pp. 162-176
    • Forsgren, A.1    Murray, W.2
  • 21
    • 0001221312 scopus 로고
    • New results on a continuously differentiable exact penalty function
    • Lucidi, S. 1992. New results on a continuously differentiable exact penalty function. SIAM J. Optim. 2 558-574.
    • (1992) SIAM J. Optim. , vol.2 , pp. 558-574
    • Lucidi, S.1
  • 23
    • 0000149118 scopus 로고
    • A modification of Armijo's step-size rule for negative curvature
    • McCormick, G. P. 1977. A modification of Armijo's step-size rule for negative curvature. Math. Programming 13 111-115.
    • (1977) Math. Programming , vol.13 , pp. 111-115
    • McCormick, G.P.1
  • 25
    • 0001818862 scopus 로고
    • On the use of directions of negative curvature in a modified Newton method
    • Moré, J J., D. C. Sorensen. 1979. On the use of directions of negative curvature in a modified Newton method. Math. Programming 16 1-20.
    • (1979) Math. Programming , vol.16 , pp. 1-20
    • Moré, J.J.1    Sorensen, D.C.2
  • 26
    • 0000965880 scopus 로고
    • Computing a trust region step
    • _, _. 1983. Computing a trust region step. SIAM J. Scientific Statist. Comput. 4 553-572.
    • (1983) SIAM J. Scientific Statist. Comput. , vol.4 , pp. 553-572
  • 27
    • 0018106354 scopus 로고
    • A second-order method for the general nonlinear programming problem
    • Mukai, H., E. Polak. 1978. A second-order method for the general nonlinear programming problem. J. Optim. Theory Appl. 26 515-532.
    • (1978) J. Optim. Theory Appl. , vol.26 , pp. 515-532
    • Mukai, H.1    Polak, E.2
  • 28
    • 0001382978 scopus 로고
    • Newton's method with a model trust region modification
    • Sorensen, D. C. 1982. Newton's method with a model trust region modification. SIAM J. Numerical Analysis 19 409-426.
    • (1982) SIAM J. Numerical Analysis , vol.19 , pp. 409-426
    • Sorensen, D.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.