+91 8617752708

British Journal of Mathematics & Computer Science, ISSN: 2231-0851,Vol.: 22, Issue.: 3

Original-research-article

Research on the Dual Problem of Trust Region Bundle Method

 

Jie Shen1 and Ya-Li Gao1*
1School of Mathematics, Liaoning Normal University, Dalian 116029, China.

Article Information
Editor(s):
(1) Dijana Mosic, Department of Mathematics, University of Nis, Serbia.
Reviewers:
(1) Xiaolan Liu, Sichuan University of Science & Engineering, China.
(2) Yasemin Sagiroglu, Karadeniz Technical University, Turkey.
Complete Peer review History: http://www.sciencedomain.org/review-history/19221

Abstracts

With the rapid development of science and technology as well as the cross-integration between the various disciplines, the nonsmooth optimization problem plays an increasingly important role in operational research. In this paper, we use the trust region method to study nonsmooth unconstrained optimization problems. Trust region subproblem is constructed to produce the next iteration point by using feasible set as constraint condition. As the number of iterations increases, the compression principle is used to control the elements in a bundle of information. And then the subproblem is studied by Lagrangian function and penalized bundle method [1]. The optimal solution and the relevant derivative conclusion are obtained by transforming the primal problem and dual problem into each other.

Keywords :

Nonsmooth optimization; trust region bundle method; subgradient; dual problem.

Full Article - PDF    Page 1-6 Article Metrics

DOI : 10.9734/BJMCS/2017/33880

Review History    Comments

Our Contacts

Guest House Road, Street no - 1/6,
Hooghly, West Bengal,
India

+91 8617752708

 

Third Floor, 207 Regent Street
London, W1B 3HH,
UK

+44 20-3031-1429