Volume 13, Issue 2 (8-2016)                   2016, 13(2): 19-33 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

An Efficient Algorithm for the Extended Trust Region Subproblem with Two Linear Constraints. Journal of Operational Research and Its Applications. 2016; 13 (2) :19-33
URL: http://jamlu.liau.ac.ir/article-1-1333-en.html
Abstract:   (3780 Views)

Trust region subproblem (TRS), which is the problem of minimizing a quadratic function over a ball, plays a key role in solving unconstrained nonlinear optimization problems. Though TRS is not necessarily convex, there are efficient algorithms to solve it, particularly in large scale. Recently, extensions of TRS with extra linear constraints have received attention of several researchers. It has been shown that in the case where the linear constraints do not intersect within  the ball, the optimal solution of the extended problem can be computed via solving a conic optimization problem. However, solving large-scale or even medium scale conic optimization problems are not practicable. In this paper, the extended trust region subproblem with two linear constraints without any assumptions on the constraints is considered.  The latest  algorithms for solving TRS and computing its  local non-global minimizer, that solve the problem via a generalized eigenvalue problem, are used to solve the extended trust region subproblem.  Finally, the efficiency of the proposed algorithm is evaluated on several randomly generated instances

Full-Text [PDF 237 kb]   (782 Downloads)    
Type of Study: Research | Subject: Special
Received: 2016/09/19 | Accepted: 2016/09/19 | Published: 2016/09/19

Add your comments about this article : Your username or Email:
CAPTCHA

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.