Parallel algorithms for nonlinear optimization

Warning The system is temporarily closed to updates for reporting purpose.

Öztoprak, Figen (2011) Parallel algorithms for nonlinear optimization. [Thesis]

[thumbnail of FigenOztoprak_409879.pdf] PDF
FigenOztoprak_409879.pdf

Download (2MB)

Abstract

Parallel algorithm design is a very active research topic in optimization as parallel computer architectures have recently become easily accessible. This thesis is about an approach for designing parallel nonlinear programming algorithms. The main idea is to benefit from parallelization in designing new algorithms rather than considering direct parallelizations of the existing methods. We give a general framework following our approach, and then, give distinct algorithms that fit into this framework. The example algorithms we have designed either use procedures of existing methods within a multistart scheme, or they are completely new inherently parallel algorithms. In doing so, we try to show how it is possible to achieve parallelism in algorithm structure (at different levels) so that the resulting algorithms have a good solution performance in terms of robustness, quality of steps, and scalability. We complement our discussion with convergence proofs of the proposed algorithms.
Item Type: Thesis
Uncontrolled Keywords: Parallel algorithm design. -- Nonlinear programming. -- Parallel optimization. -- Parallel computing. -- Nonlinear optimization. -- Paralel algoritma tasarımı. -- Doğrusal olmayan programlama. -- Paralel eniyileme. -- Doğrusal olmayan programlama. -- Paralel hesaplama.
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5101-6720 Telecommunication
Divisions: Faculty of Engineering and Natural Sciences
Faculty of Engineering and Natural Sciences > Academic programs > Manufacturing Systems Eng.
Depositing User: IC-Cataloging
Date Deposited: 25 Sep 2014 09:57
Last Modified: 26 Apr 2022 10:01
URI: https://research.sabanciuniv.edu/id/eprint/24548

Actions (login required)

View Item
View Item