A parallel algorithm for partially separable non-convex global minimization: Linear constraints
The global minimization of large-scale partially separable non-convex problems over a bounded polyhedral set using a parallel branch and bound approach is considered. The objective function is a sum of a separable concave part, an unseparated convex part and a linear part. These large- scale problems are characterized by having the number of linear variables much greater than the number of nonlinear variables. A convex underestimating function to the objective function is constructed and minimized over the feasible domain to get both upper and lower bounds on the global minimum function value. At each iteration of the algorithm the feasible domain is divided into subregions and convex underestimating problems over each subregion are solved in parallel. Branch and bound techniques are used. Computational results are also presented.
- A parallel algorithm for constrained concave quadratic global minimization
- scientific article; zbMATH DE number 1163103
- Parallel computing in nonconvex programming
- scientific article; zbMATH DE number 4164557
- A parallel stochastic method for solving linearly constrained concave global minimization problems
- A parallel algorithm for constrained concave quadratic global minimization
- Active constraints, indefinite quadratic test problems, and complexity
- An Algorithm for Separable Nonconvex Programming Problems
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
- Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
- scientific article; zbMATH DE number 4112395 (Why is no real title available?)
- scientific article; zbMATH DE number 3537446 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- scientific article; zbMATH DE number 3301979 (Why is no real title available?)
- A parallel algorithm for constrained concave quadratic global minimization
- A parallel global optimization algorithm for rational separable- factorable functions
- Global optimization of fractional programs
- Sufficient conditions for solving linearly constrained separable concave global minimization problems
- Parallel computing in nonconvex programming
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
- A parallel computing scheme for minimizing a class of large scale functions
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- A continuous approch for globally solving linearly constrained quadratic
- Parallel Uzawa method for large-scale minimization of partially separable functions
- scientific article; zbMATH DE number 1163103 (Why is no real title available?)
- Subdomain separability in global optimization
- New formulations of the multiple sequence alignment problem
- Parallel algorithms for global optimization problems
This page was built for publication: A parallel algorithm for partially separable non-convex global minimization: Linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276880)
