A robust trust region method for general constrained optimization

Ju-liang Zhang ()

Mathematical Methods of Operations Research, 2004, vol. 60, issue 1, 73-85

Abstract: In this paper, a new trust region method is presented for general constrained optimization problem. In this algorithm, the trial step is obtained by solving two quadratic programming problems with bound constraints. The algorithm is implementable easily. Then we prove that the method is globally convergent without regularity assumptions. Preliminary numerical experiments show the efficiency of the algorithm. Copyright Springer-Verlag 2004

Keywords: General constrained optimization; Global convergence; Trust region method; Nonlinear programming; Regularity condition (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860300333 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:60:y:2004:i:1:p:73-85

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860300333

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().