Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer
Journal Article
·
· J. Optimization Theory Appl.; (United States)
Parallel algorithms and test case results for the solution of the unconstrained optimization problem are presented. The algorithms involve the use of pseudo-conjugate directions (directions which tend to become conjugate as the solution is approached). It is shown that the algorithms are both fast and robust. Although all the algorithms of this paper involve the parallel execution of linear search procedures, a critical differentiation can be made among them, depending on whether the linear searches are performed along the same direction (parallel unidirectional algorithms) or different directions (parallel multidirectional algorithms). 14 references.
- Research Organization:
- American Electric Power Service Co., New York, NY
- OSTI ID:
- 5211059
- Journal Information:
- J. Optimization Theory Appl.; (United States), Vol. 2
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel nonlinear optimization methods with applications to power systems
Parallel-vector computation for structural analysis and nonlinear unconstrained optimization problems. Final Report, period ending 15 Jun. 1990
Fast parallel algorithms for the Moore-Penrose pseudo-inverse
Thesis/Dissertation
·
Thu Jan 01 00:00:00 EST 1981
·
OSTI ID:5211059
Parallel-vector computation for structural analysis and nonlinear unconstrained optimization problems. Final Report, period ending 15 Jun. 1990
Technical Report
·
Sat Sep 01 00:00:00 EDT 1990
·
OSTI ID:5211059
Fast parallel algorithms for the Moore-Penrose pseudo-inverse
Conference
·
Wed Jan 01 00:00:00 EST 1986
·
OSTI ID:5211059