Parallel computing in nonconvex programming

DOI10.1007/BF02024487zbMath0784.90057MaRDI QIDQ1309859

G. M. Guisewite, Panos M. Pardalos

Publication date: 20 December 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

global optimizationnonconvex optimizationparallel algorithmsminimum concave cost network flowmulti-transputer system

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent stochastic methods for global optimization
• State-of-the-art in parallel nonlinear optimization
• Constrained global optimization: algorithms and applications
• Checking local optimality in constrained quadratic programming is NP- hard
• Parallel search algorithms in global optimization
• A collection of test problems for constrained global optimization algorithms
• Global search algorithms for minimum concave-cost network flow problems
• A parallel algorithm for partially separable non-convex global minimization: Linear constraints
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Stochastic Methods for Global Optimization
• Decomposition Principle for Linear Programs
• Global Optimization Approach to the Linear Complementarity Problem
• Adjacent extreme flows and application to min concave cost flow problems
• Parallel Numerical Optimization: Current Status and an Annotated Bibliography
• Minimum cost routing for static network models
• Global optimization