Pavlo A. Krokhmal<\/p>\n
Oleg A. Prokopyev<\/p>\n
<\/p>\n
Dear Colleagues:<\/p>\n
It is our pleasure to announce that the following paper was named the winner of the 2018 OPTL Best Paper Award<\/strong>:<\/p>\n Frank E. Curtis, Zachary Lubberts, Daniel P. Robinson (2018), Concise complexity analyses for trust region methods, Optimization Letters<\/em> 12(8), 1713-1724.<\/p>\n Abstract: Concise complexity analyses are presented for simple trust region algorithms for solving unconstrained optimization problems. In contrast to a traditional trust region algorithm, the algorithms considered in this paper require certain control over the choice of trust region radius after any successful iteration. The analyses highlight the essential algorithm components required to obtain certain complexity bounds. In addition, a new update strategy for the trust region radius is proposed that offers a second-order complexity bound.<\/p>\n Please join us in congratulating the authors of the paper, Dr. Curtis, Dr. Lubberts and Dr. Robinson, for their excellent contribution to literature!<\/p>\n The OPTL Best Paper Award carries a 1,000 USD prize and a plaque. This year the Best Paper Award Selection Committee included OPTL Editorial Board members Dr. Sandra D. Eksioglu, Dr. Jean-Philippe Richard and Dr. Julius \u017dilinskas. We want to thank the members of the Committee for their service and Springer for sponsoring the award. We also would like to take this opportunity to invite nominations for the 2019 OPTL Best Paper Award. All papers published in OPTL during the year of 2019 are eligible.<\/p>\n","protected":false},"template":"","class_list":["post-14681","news","type-news","status-publish","hentry","news_categories-awards-and-honors"],"acf":[],"yoast_head":"\n