scientific article; zbMATH DE number 1163103
zbMATH Open0903.90150MaRDI QIDQ4394592FDOQ4394592
simulated annealinglocal searchnon-convex optimizationinterval arithmetictabu searchbranch-and-boundstochastic methodsrandom searchparallel global optimizationindefinite quadratic programmingtunneling algorithmposynomial optimization
Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Discrete location and assignment (90B80)
Recommendations
- Parallel computing in nonconvex programming
- A parallel algorithm for partially separable non-convex global minimization: Linear constraints
- A parallel algorithm for constrained concave quadratic global minimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- A view of the limitations, opportunities, and challenges in parallel nonlinear optimization
Cited In (10)
- Parallel Processing and Applied Mathematics
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Asynchronous parallel algorithms for nonconvex optimization
- Parallel computing in nonconvex programming
- A parallel stochastic method for solving linearly constrained concave global minimization problems
- Parallel and distributed successive convex approximation methods for big-data optimization
- Expanding neighborhood GRASP for the traveling salesman problem
- Solving large-scale TSP using a fast wedging insertion partitioning approach
- Title not available (Why is no real title available?)
- Enumerative techniques for solving some nonconvex global optimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394592)
