메뉴 건너뛰기




Volumn 218, Issue 22, 2012, Pages 11089-11099

A new penalty-free-type algorithm based on trust region techniques

Author keywords

Feasibility safeguarding; Global convergence; Penalty free type; Trust region method

Indexed keywords

EQUALITY-CONSTRAINED PROBLEM; FEASIBILITY SAFEGUARDING; FILTER TECHNIQUES; GLOBAL CONVERGENCE; MERIT FUNCTION; NUMERICAL TESTS; PENALTY FUNCTION; PENALTY PARAMETERS; PENALTY-FREE-TYPE; STANDARD ASSUMPTIONS; TRUST REGION; TRUST REGION FRAMEWORK; TRUST-REGION METHODS;

EID: 84862884543     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2012.04.065     Document Type: Article
Times cited : (5)

References (22)
  • 1
    • 7244253635 scopus 로고    scopus 로고
    • A pattern search filter method for nonlinear programming without derivative
    • C. Audet, and J.E. Dennis Jr. A pattern search filter method for nonlinear programming without derivative SIAM J. Optim. 14 4 2004 980 1010
    • (2004) SIAM J. Optim. , vol.14 , Issue.4 , pp. 980-1010
    • Audet, C.1    Dennis, Jr.J.E.2
  • 2
    • 0003298453 scopus 로고
    • Robust trust region methods for constrained optimization
    • Houseton, Texas, May
    • R.H. Byrd, Robust trust region methods for constrained optimization, in: Third SIAM Conference on Optimization, Houseton, Texas, May 1987.
    • (1987) Third SIAM Conference on Optimization
    • Byrd, R.H.1
  • 3
    • 0023430609 scopus 로고
    • A trust region Algorithm for nonlinearly constrained optimization
    • R.H. Byrd, R.B. Schnabel, and G.A. Shultz A trust region Algorithm for nonlinearly constrained optimization SIAM J. Numer. Anal. 24 1987 1152 1170
    • (1987) SIAM J. Numer. Anal. , vol.24 , pp. 1152-1170
    • Byrd, R.H.1    Schnabel, R.B.2    Shultz, G.A.3
  • 4
    • 14944352190 scopus 로고    scopus 로고
    • On the global convergence of an SLP-filter algorithm that takes EQP steps
    • C.M. Chin, and R. Fletcher On the global convergence of an SLP-filter algorithm that takes EQP steps Math. Prog. 96 2001 161 177
    • (2001) Math. Prog. , vol.96 , pp. 161-177
    • Chin, C.M.1    Fletcher, R.2
  • 5
    • 33947588331 scopus 로고    scopus 로고
    • Global and local convergence of a filter line search method for nonlinear programming
    • C.M. Chin, A.H.A. Rashid, and K. Mohamed Nor Global and local convergence of a filter line search method for nonlinear programming Optim. Methods Softw. 22 2007 365 390
    • (2007) Optim. Methods Softw. , vol.22 , pp. 365-390
    • Chin, C.M.1    Rashid, A.H.A.2    Mohamed Nor, K.3
  • 6
    • 32644437918 scopus 로고    scopus 로고
    • A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
    • Z.W. Chen A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization Appl. Math. Comput. 173 2006 1014 1046
    • (2006) Appl. Math. Comput. , vol.173 , pp. 1014-1046
    • Chen, Z.W.1
  • 7
    • 0031542597 scopus 로고    scopus 로고
    • A global convergence theory for general trust-region based algorithms for equality constrained optimization
    • J.E. Dennis, M. El-Alem, and M.C. Maciel A global convergence theory for general trust-region based algorithms for equality constrained optimization SIAM J. Optim. 7 1997 177 207
    • (1997) SIAM J. Optim. , vol.7 , pp. 177-207
    • Dennis, J.E.1    El-Alem, M.2    MacIel, M.C.3
  • 8
    • 0001556338 scopus 로고    scopus 로고
    • Nonlinear programming without a penalty function
    • R. Fletcher, and S. Leyffer Nonlinear programming without a penalty function Math. Prog. Ser. A 91 2002 39 269
    • (2002) Math. Prog. Ser. A , vol.91 , pp. 39-269
    • Fletcher, R.1    Leyffer, S.2
  • 9
    • 0742308730 scopus 로고    scopus 로고
    • A bundle filter method for nonsmooth nonlinear optimization
    • Department of Mathematics, University of Dundee, Scotland, December
    • Fletcher, S. Leyffer, A bundle filter method for nonsmooth nonlinear optimization. Technical Report NA/195, Department of Mathematics, University of Dundee, Scotland, December 1999.
    • (1999) Technical Report NA/195
    • Fletcher, R.1    Leyffer, S.2
  • 10
    • 0037288670 scopus 로고    scopus 로고
    • On the global convergence of an filter-SQP algorithm
    • R. Fletcher, S. Leyffer, and Ph.L. Toint On the global convergence of an filter-SQP algorithm SIAM J. Optim. 13 2002 44 59
    • (2002) SIAM J. Optim. , vol.13 , pp. 44-59
    • Fletcher, R.1    Leyffer, S.2    Toint, Ph.L.3
  • 11
    • 0042354662 scopus 로고    scopus 로고
    • Global convergence of trust-region SQP-filter algorithms for general nonlinear programming
    • R. Fletcher, N.I.M. Gould, S. Leyffer, A. Wächter, and Ph.L. Toint Global convergence of trust-region SQP-filter algorithms for general nonlinear programming SIAM J. Optim. 13 2002 635 659
    • (2002) SIAM J. Optim. , vol.13 , pp. 635-659
    • Fletcher, R.1    Gould, N.I.M.2    Leyffer, S.3    Wächter, A.4    Toint, Ph.L.5
  • 12
    • 68449102019 scopus 로고    scopus 로고
    • Nonlinear programming without a penalty function or a filter
    • N.I.M. Gould, and Ph.L. Toint Nonlinear programming without a penalty function or a filter Math. Prog. 122 2010 155 196
    • (2010) Math. Prog. , vol.122 , pp. 155-196
    • Gould, N.I.M.1    Toint, Ph.L.2
  • 15
    • 34250232455 scopus 로고
    • The nonlinear programming method of Wilson Han and Powell with an augmented Lagrangian type line search function
    • K. Schittkowski The nonlinear programming method of Wilson Han and Powell with an augmented Lagrangian type line search function Numer. Math. 38 1981 83 114
    • (1981) Numer. Math. , vol.38 , pp. 83-114
    • Schittkowski, K.1
  • 16
    • 21044440965 scopus 로고    scopus 로고
    • Nonmonotone trust region methods for nonlinear equality constrained optimization without a penalty function
    • M. Ulbrich, and S. Ulbrich Nonmonotone trust region methods for nonlinear equality constrained optimization without a penalty function Math. Prog. 95 2003 103 135
    • (2003) Math. Prog. , vol.95 , pp. 103-135
    • Ulbrich, M.1    Ulbrich, S.2
  • 17
    • 14944387007 scopus 로고    scopus 로고
    • A globally convergent primal-dual interior-point filter method for nonlinear programming
    • M. Ulbrich, S. Ulbrich, and L.N. Vicente A globally convergent primal-dual interior-point filter method for nonlinear programming Math. Prog. 100 2004 231 252
    • (2004) Math. Prog. , vol.100 , pp. 231-252
    • Ulbrich, M.1    Ulbrich, S.2    Vicente, L.N.3
  • 18
    • 19844381859 scopus 로고    scopus 로고
    • On the superlinear local convergence of a filter-SQP method
    • S. Ulbrich On the superlinear local convergence of a filter-SQP method Math. Prog. Ser. B 100 2004 217 245
    • (2004) Math. Prog. Ser. B , vol.100 , pp. 217-245
    • Ulbrich, S.1
  • 19
    • 33144460598 scopus 로고    scopus 로고
    • Line search filter methods for nonlinear programming: Motivation and global convergence
    • A. Wächter, and L.T. Biegler Line search filter methods for nonlinear programming: Motivation and global convergence SIAM J. Optim. 16 2005 1 31
    • (2005) SIAM J. Optim. , vol.16 , pp. 1-31
    • Wächter, A.1    Biegler, L.T.2
  • 20
    • 33144472862 scopus 로고    scopus 로고
    • Line search filter methods for nonlinear programming: Local convergence
    • A. Wächter, and L.T. Biegler Line search filter methods for nonlinear programming: Local convergence SIAM J. Optim. 16 2005 32 48
    • (2005) SIAM J. Optim. , vol.16 , pp. 32-48
    • Wächter, A.1    Biegler, L.T.2
  • 21
    • 29144523061 scopus 로고    scopus 로고
    • On the implementation of an interior-point filter line-search algorithm for large scale nonlinear programming
    • A. Wächter, and L.T. Biegler On the implementation of an interior-point filter line-search algorithm for large scale nonlinear programming Math. Prog. Ser. A 106 2006 25 57
    • (2006) Math. Prog. Ser. A , vol.106 , pp. 25-57
    • Wächter, A.1    Biegler, L.T.2


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