Parallel algorithms for nonlinear programming problems

DOI10.1007/BF00940841zbMath0642.90083MaRDI QIDQ1101346

M. Dayde

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsseparable programmingpenalty functionquadratic approximationdual methodparallel Jacobson-Oksman algorithmparallel variable metric algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

A parallel algorithm for constrained optimization problems

Cites Work

• A gradient projection-multiplier method for nonlinear programming
• Parallel algorithms for solving nonlinear two-point boundary-value problems which arise in optimal control
• An algorithm that minimizes homogeneous functions of \(n\) variables in \(n + 2\) iterations and rapidly minimizes general functions
• Structural weight optimization by dual methods of convex programming
• Unconstrained optimization based on homogeneous models
• Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
• A Rapidly Convergent Descent Method for Minimization
• A Survey of Parallelism in Numerical Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item