지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국전산응용수학회 Journal of applied mathematics & computing Journal of applied mathematics & computing 제24권 제1호
- 발행연도
- 2007.1
- 수록면
- 325 - 331 (7page)
이용수
초록· 키워드
오류제보하기
To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm associated with the general line search model. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the new quasi-Newton iteration equation $B_{k+1}s_k=y^*_k,\;where\;y^*_k$ is the sum of $y_k\;and\;A_ks_k,\;and\;A_k$ is some matrix. The global convergence properties of the algorithm associating with the general form of line search is proved.
목차
등록된 정보가 없습니다.
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
GLOBAL CONVERGENCE PROPERTIES OF THE MODIFIED BFGS METHOD ASSOCIATING WITH GENERAL LINE SEARCH MODEL
Journal of applied mathematics & computing
2004 .01
-
GLOBAL CONVERGENCE PROPERTIES OF TWO MODIFIED BFGS-TYPE METHODS
Journal of applied mathematics & computing
2007 .01
-
A TYPE OF MODIFIED BFGS ALGORITHM WITH ANY RANK DEFECTS AND THE LOCAL Q-SUPERLINEAR CONVERGENCE PROPERTIES
Journal of applied mathematics & computing
2006 .01
-
MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION
대한수학회지
2010 .01
-
A MODIFIED BFGS BUNDLE ALGORITHM BASED ON APPROXIMATE SUBGRADIENTS
Journal of applied mathematics & informatics
2010 .01
-
CONVERGENCE OF DESCENT METHOD WITH NEW LINE SEARCH
Journal of applied mathematics & computing
2006 .01
-
SOLVING MATRIX POLYNOMIALS BY NEWTON'S METHOD WITH EXACT LINE SEARCHES
JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
2008 .08
-
CONVERGENCE OF NEWTON’S METHOD FOR SOLVING MATRIX POLYNOMIAL WITH EXACT LINE SEARCHES
한국산업응용수학회 학술대회 논문집
2011 .05
-
Global convergence of an efficient hybrid conjugate gradient method for unconstrained optimization
대한수학회보
2013 .01
-
Newton Schulz method for solving nonlinear matrix equation $X^p + {A^*}XA=Q$
대한수학회지
2018 .01
-
A new quasi-Newton method based on adjoint Broyden updates for symmetric nonlinear equations
대한수학회지
2016 .01
-
CONVERGENCE PROPERTIES OF A CORRELATIVE POLAK-RIBIERE CONJUGATE GRADIENT METHOD
Journal of applied mathematics & computing
2006 .01
-
CONVERGENCE OF SUPERMEMORY GRADIENT METHOD
Journal of applied mathematics & computing
2007 .01
-
A NONLINEAR CONJUGATE GRADIENT METHOD AND ITS GLOBAL CONVERGENCE ANALYSIS
Journal of applied mathematics & informatics
2016 .01
-
On Newton's Method for Solving a System of Nonlinear Matrix Equations
East Asian Mathematical Journal
2019 .01
-
A SELF SCALING MULTI-STEP RANK ONE PATTERN SEARCH ALGORITHM
JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
2011 .12
-
Improved convergence results for generalized equations
East Asian Mathematical Journal
2008 .01
-
A HIGHER ORDER ITERATIVE ALGORITHM FOR MULTIVARIATE OPTIMIZATION PROBLEM
Journal of applied mathematics & informatics
2014 .01
-
GLOBAL CONVERGENCE OF A NEW SPECTRAL PRP CONJUGATE GRADIENT METHOD
Journal of applied mathematics & informatics
2011 .01
-
A NEW LIMITED MEMORY QUASI-NEWTON METHOD FOR UNCONSTRAINED OPTIMIZATION
JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
2003 .06
이 논문의 저자 정보
최근 본 자료
댓글(0)
0