Jump to ContentJump to Main Navigation
Show Summary Details

Journal of Inverse and Ill-posed Problems

Editor-in-Chief: Kabanikhin, Sergey I.

6 Issues per year


IMPACT FACTOR increased in 2015: 0.987
Rank 59 out of 312 in category Mathematics and 93 out of 254 in Applied Mathematics in the 2015 Thomson Reuters Journal Citation Report/Science Edition

SCImago Journal Rank (SJR) 2015: 0.583
Source Normalized Impact per Paper (SNIP) 2015: 1.106
Impact per Publication (IPP) 2015: 0.712

Mathematical Citation Quotient (MCQ) 2015: 0.43

Online
ISSN
1569-3945
See all formats and pricing
Volume 11, Issue 6 (Dec 2003)

Issues

On the ill-posedness of the trust region subproblem

Le Thi Hoai An
  • Laboraroire Informatique Théorique & Appliquée (LITA EA 3097), UFR MIM, Université de Metz, Ile du Saulcy, F57045 Metz Cedex 01, France. E-mail:
  • Laboratoire de Mathématique (LMI), Institut National des Sciences Appliquée (INSA) de Rouen, BP 8, F76131 Mont Saint Aignan, France. E-mails: ,
/ Pham Dinh Tao
  • Laboratoire de Mathématique (LMI), Institut National des Sciences Appliquée (INSA) de Rouen, BP 8, F76131 Mont Saint Aignan, France. E-mails: ,
/ Dinh Nho Hào
  • Hanoi Institute of Mathematics, 18 Hoang Quoc Viet, 10307 Hanoi, Vietnam and Vrije Universiteit Brussel (VUB), Department of Electronics and Information Processing (ETRO), Pleinlaan 2, 1050 Brussels, Belgium. E-mails: , .

The trust region subproblem plays an important role in optimization and numerical analysis. Many researchers even use it in regularizing ill-posed problems. It appears that the trust region subproblem is ill-posed: the set of solutions is unstable with respect to the data in the functional to be minimized, that is a small error in the functional to be minimized might cause large errors in the set of solutions. The aim of the paper is to study the ill-posed nature of the problem and to suggest methods to overcome the ill-posedness. The methods are mainly based on Tikhonov regularization with the generalized discrepancy principle suggested by Goncharskii, Leonov, and Yagola and the difference of convex functions algorithm (DCA) recently developed by Pham Dinh Tao and Le Thi Hoai An. The open problem of Tikhonov regularization methods for non-linear ill-posed problems how to globally solve non-linear (in general non-convex) optimization problems occurred from them is completely answered for the trust region subproblem by DCA. Several test numerical examples are outlined.

About the article

Published Online:

Published in Print: 2003-12-15


Citation Information: Journal of Inverse and Ill-posed Problems jiip, ISSN (Online) 1569-3953, ISSN (Print) 0928-0219, DOI: https://doi.org/10.1515/156939403322759642. Export Citation

Comments (0)

Please log in or register to comment.
Log in