A multiprocessor interior point algorithm

DOI10.1108/03684929610118363MaRDI QIDQ4246474zbMATH OpenOpenAlexFDO

Authors Martin Saarinen, Ralf Östermark

Publication date 6 June 1999

Published in Kybernetes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/03684929610118363

zbMATH Keywords

conjugate gradient methodinterior point algorithmmultiple-criteria decision-makingexternal reconstruction approachDe Novo programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Parallel numerical computation (65Y05) Linear programming (90C05)

Cites work

• An external reconstruction approach (ERA) to linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Parallel Solution of Large-Scale, Block-Diagonal Concave Maximization Problems

Cited in

(6)

• A flexible platform for mixed-integer non-linear programming problems
• A recursive partitioning algorithm for matrix inversion on parallel computers
• Scalability of the genetic hybrid algorithm on a parallel supercomputer
• A fuzzy linear basis algorithm for nonlinear separable programming problems.
• A multipurpose parallel genetic hybrid algorithm for nonlinear nonconvex programming problems
• Dynamic portfolio management under competing representations

This page was built for publication: A multiprocessor interior point algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246474)