A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer

DOI10.1016/0168-9274(91)90008-NMaRDI QIDQ809551zbMATH OpenFDO

Authors T. L. Freeman

Publication date 1991

Published in Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

performanceunconstrained optimizationIntel iPSC/2 Hypercubelocal memory parallel computerparallel quasi-Newton algorithmparallel symmetric rank-two algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Nonlinear programming (90C30)

Recommendations

• A General-Purpose Parallel Algorithm for Unconstrained Optimization
• Parallel quasi-Newton methods for unconstrained optimization
• Multi-directional parallel algorithms for unconstrained optimization
• A parallel quasi-Newton algorithm for unconstrained optimization
• Parallel variable metric algorithms for unconstrained optimization

Cites work

• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 4127024 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• A New Direction Set Method for Unconstrained Minimization without Evaluating Derivatives
• Concurrent function evaluations in local and global optimization
• Matrix conditioning and nonlinear optimization
• Numerical comparison of several variable metric algorithms
• On the Modification of LDL T Factorizations
• Optimally conditioned optimization algorithms without line searches
• Parallel quasi-Newton methods for unconstrained optimization
• Parallel variable metric algorithms for unconstrained optimization
• Quadratic termination properties of Davidon's new variable metric algorithm
• State-of-the-art in parallel nonlinear optimization
• Testing Unconstrained Optimization Software
• The Convergence of a Class of Double-rank Minimization Algorithms
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• Unified approach to quadratically convergent algorithms for function minimization

Cited in

(4)

• A General-Purpose Parallel Algorithm for Unconstrained Optimization
• Parallel quasi-Newton methods for unconstrained optimization
• CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
• scientific article; zbMATH DE number 176391 (Why is no real title available?)

Describes a project that uses

Uses Software

• minpack

This page was built for publication: A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809551)