Concurrent search algorithms for unconstrained optimization

Öztoprak, Figen and Birbil, Ş. İlker (2010) Concurrent search algorithms for unconstrained optimization. (Submitted)

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


Parallel processing enables performing concurrent operations. The execution time of a given computational task is expected to be decreased by distributing its computations among parallel processors. The majority of the works in the parallel nonlinear optimization literature focuses on speeding up some well-known sequential algorithms by parallel execution of their computationally intensive tasks. In this study, on the other hand, we discuss an alternative perspective that leads to new nonlinear programming algorithms, which are inherently parallel by design. To support our discussion with a successful application, we introduce a concurrent search framework for unconstrained nonlinear optimization and provide extensive numerical results with two algorithms that fall into the proposed framework

Item Type:Article
Uncontrolled Keywords:parallel algorithm; multi-core; shared memory; unconstrained; nonlinear programming; trust-region; line-search; concurrent search; information exchange
Subjects:T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis
Q Science > QA Mathematics > QA076 Computer software
ID Code:15898
Deposited By:Ş. İlker Birbil
Deposited On:07 Dec 2010 16:43
Last Modified:07 Dec 2010 16:43

Repository Staff Only: item control page