Optimization Online


A hybrid algorithm for the two-trust-region subproblem

Saeid Ansary Karbasy(saeidansary144***at***yahoo.com)
Maziar Salahi(salahim***at***guilan.ac.ir)

Abstract: Two-trust-region subproblem (TTRS), which is the minimization of a general quadratic function over the intersection of two full-dimensional ellipsoids, has been the subject of several recent research. In this paper, to solve TTRS, a hybrid of efficient algorithms for finding global and local-nonglobal minimizers of trust-region subproblem and the alternating direction method of multipliers (ADMM) is proposed. The convergence of the ADMM steps to the first order stationary condition is proved under certain conditions. On several classes of test problems, we compare the new algorithm with the recent algorithm of Sakaue et. al's \cite{SakaueNakat:16} and Snopt software.

Keywords: Two-trust-region subproblem, Trust-region subproblem, Local non-global minimum, Alternating direction method of multipliers.

Category 1: Global Optimization

Category 2: Nonlinear Optimization (Quadratic Programming )


Download: [Postscript][PDF]

Entry Submitted: 07/19/2018
Entry Accepted: 08/01/2018
Entry Last Modified: 07/19/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society