scholarly journals A Note on Using Partitioning Techniques for Solving Unconstrained Optimization Problems on Parallel Systems

2015 ◽  
Vol 20 (2) ◽  
pp. 12 ◽  
Author(s):  
Mehiddin Al-Baali ◽  
Chefi Triki
Keyword(s):  
Parallel Algorithms ◽  
Nonlinear Optimization ◽  
Unconstrained Optimization ◽  
Solution Method ◽  
Optimization Problems ◽  
Parallel Systems ◽  
Iterative Solution ◽  
Parallel Method ◽  
Unconstrained Optimization Problems ◽  
Iterative Solution Method

We deal with the design of parallel algorithms by using variable partitioning techniques to solve nonlinear optimization problems. We propose an iterative solution method that is very efficient for separable functions, our scope being to discuss its performance for general functions. Experimental results on an illustrative example have suggested some useful modifications that, even though they improve the efficiency of our parallel method, leave some questions open for further investigation. 

scholarly journals A multi-step curve search algorithm in nonlinear optimization

2008 ◽  
Vol 18 (1) ◽  
pp. 47-52 ◽  
Author(s):  
Nada Djuranovic-Milicic
Keyword(s):  
Rate Of Convergence ◽  
Nonlinear Optimization ◽  
Unconstrained Optimization ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Unconstrained Optimization Problems ◽  
Convergence Proof ◽  
Step Algorithm

In this paper a multi-step algorithm for LC1 unconstrained optimization problems is presented. This method uses previous multi-step iterative information and curve search to generate new iterative points. A convergence proof is given, as well as an estimate of the rate of convergence.

A Non-Monotone Line Search Combination Technique for Unconstrained Optimization

2014 ◽  
Vol 8 (1) ◽  
pp. 218-221 ◽  
Author(s):  
Ping Hu ◽  
Zong-yao Wang
Keyword(s):  
Global Convergence ◽  
Unconstrained Optimization ◽  
Numerical Experiments ◽  
Line Search ◽  
Optimization Problems ◽  
Search Algorithm ◽  
New Combination ◽  
Combination Rule ◽  
Combination Technique ◽  
Unconstrained Optimization Problems

We propose a non-monotone line search combination rule for unconstrained optimization problems, the corresponding non-monotone search algorithm is established and its global convergence can be proved. Finally, we use some numerical experiments to illustrate the new combination of non-monotone search algorithm’s effectiveness.

Parallel-vector computation for linear structural analysis and non-linear unconstrained optimization problems

1991 ◽  
Vol 2 (2-3) ◽  
pp. 175-182 ◽  
Author(s):  
D.T. Nguyen ◽  
O.O. Storaasli ◽  
E.A. Carmona ◽  
M. Al-Nasra ◽  
Y. Zhang ◽  
...  
Keyword(s):  
Structural Analysis ◽  
Unconstrained Optimization ◽  
Optimization Problems ◽  
Unconstrained Optimization Problems ◽  
Non Linear
Sign in / Sign up

Export Citation Format

Share Document