Parallel algorithms for nonlinear programming problems
This paper describes several parallel algorithms for solving nonlinear programming problems. Two approaches where parallelism can successfully be introduced have been explored: a quadratic approximation method based on penalty function and a dual method. These methods are improved by using two algorithms originally proposed for solving unconstrained problems: the parallel variable metric algorithm and the parallel Jacobson-Oksman algorithm. Even though general problems are dealt with, particular emphasis is placed on the potential of these parallel methods for separable programming problems. The numerical effectiveness of the algorithms is demonstrated on a set of test problems using a CRAY-1S vector computer and serial computers (with respect to sequential versions of the same methods).
- A gradient projection-multiplier method for nonlinear programming
- A Rapidly Convergent Descent Method for Minimization
- A Survey of Parallelism in Numerical Analysis
- An algorithm that minimizes homogeneous functions of \(n\) variables in \(n + 2\) iterations and rapidly minimizes general functions
- Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
- scientific article; zbMATH DE number 3930730 (Why is no real title available?)
- scientific article; zbMATH DE number 3952205 (Why is no real title available?)
- scientific article; zbMATH DE number 3976759 (Why is no real title available?)
- scientific article; zbMATH DE number 4058976 (Why is no real title available?)
- scientific article; zbMATH DE number 3697877 (Why is no real title available?)
- scientific article; zbMATH DE number 3709946 (Why is no real title available?)
- scientific article; zbMATH DE number 3709947 (Why is no real title available?)
- scientific article; zbMATH DE number 3725181 (Why is no real title available?)
- scientific article; zbMATH DE number 3504689 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3402375 (Why is no real title available?)
- Parallel algorithms for solving nonlinear two-point boundary-value problems which arise in optimal control
- Structural weight optimization by dual methods of convex programming
- Unconstrained optimization based on homogeneous models
- State-of-the-art in parallel nonlinear optimization
- A parallel algorithm for linear programming problems
- Parallel computing in nonconvex programming
- Supporting adaptive and irregular parallelism for non-linear numerical optimization
- A parallel algorithm for constrained optimization problems
- Parallel algorithms for solving large-scale nonlinear optimization problems.
- scientific article; zbMATH DE number 4191421 (Why is no real title available?)
- scientific article; zbMATH DE number 4162167 (Why is no real title available?)
- scientific article; zbMATH DE number 1206115 (Why is no real title available?)
- scientific article; zbMATH DE number 1114119 (Why is no real title available?)
- scientific article; zbMATH DE number 1488818 (Why is no real title available?)
- scientific article; zbMATH DE number 1830948 (Why is no real title available?)
- Parallel algorithm for solving linear programming problem under conditions of incomplete data
- Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization
This page was built for publication: Parallel algorithms for nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101346)
