logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Trust region algorithm for nonsmooth optimization

delete1997-09-01
delete10
PRE
AI
D
deSampaio, RJB *
J
Jinyun Yuan
W
Wenyu Sun
DOI：10.1016/S0096-3003(96)00112-9delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Minimization of a composite function h(f(x)) is considered here, where f: R-n --> R-m is a locally Lipschitzian function, and h: R-m --> R is a continuously differentiable convex function. Theory of trust region algorithm for nonsmooth optimization given by Fletcher, Powell, and Yuan, is extended to this Ease. Trust region algorithm and its global convergence are studied. Finally, same applications on nonlinear and nonsmooth least squares problems are also given. (C) Elsevier Science Inc., 1997.
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Mathematics and Computation cover
Applied Mathematics and Computation
IF:
3.4
Papers:
2.3W
Citations:
3.3W

Organization

No organization information available