A parallel implementation of the simplex function minimization routine
From MaRDI portal
Publication:2461663
DOI10.1007/S10614-007-9094-2zbMATH Open1127.65036OpenAlexW2045301184MaRDI QIDQ2461663FDOQ2461663
Publication date: 21 November 2007
Published in: Computational Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10614-007-9094-2
Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Nonlinear programming (90C30)
Cites Work
- A Simplex Method for Function Minimization
- Conditional Choice Probabilities and the Estimation of Dynamic Models
- Social security and the retirement and savings behavior of low-income households
- Direct Search Methods on Parallel Machines
- Intersectoral Labor Mobility and the Growth of the Service Sector
- Solving finite mixture models: Efficient computation in economics under serial and parallel execution
- Maximum likelihood estimation using parallel computing: An introduction to MPI
- A parallel primal-dual simplex algorithm
- A distributed parallel genetic algorithm for solving optimal growth models
- Parallelizing the Dual Simplex Method
- User-friendly parallel computations with econometric examples
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
Cited In (9)
- Multi-core CPUs, clusters, and grid computing: A tutorial
- Accounting for wage and employment changes in the US from 1968--2000: a dynamic model of labor market equilibrium
- Multi-direction-based NelderโMead method
- Cluster-based feedback control of turbulent post-stall separated flows
- The simplex method as a global optimizer: A \(C\)-programming perspective
- A THREE-LEVEL PARALLELISATION SCHEME AND APPLICATION TO THE NELDER-MEAD ALGORITHM
- A parallel minimization algorithm based on a 1 homogeneous model
- ESTIMATION OF DYNAMIC DISCRETE CHOICE MODELS BY MAXIMUM LIKELIHOOD AND THE SIMULATED METHOD OF MOMENTS
- Title not available (Why is that?)
Recommendations
- Towards a practical parallelisation of the simplex method ๐ ๐
- Advances in the Parallelization of the Simplex Method ๐ ๐
- A parallel primal-dual simplex algorithm ๐ ๐
- A Parallel Implementation of the Revised Simplex Algorithm Using OpenMP: Some Preliminary Results ๐ ๐
- A parallel computing scheme for minimizing a class of large scale functions ๐ ๐
- Parallelizing the Dual Simplex Method ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Parallel approximation of min-max problems ๐ ๐
- Parallel search paths for the simplex algorithm ๐ ๐
This page was built for publication: A parallel implementation of the simplex function minimization routine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461663)