Concurrent processing of mixed‐integer non‐linear programming problems

DOI10.1108/03684920910973180zbMath1205.90206OpenAlexW1998140249MaRDI QIDQ4932950

Ralf Oestermark

Publication date: 7 October 2010

Published in: Kybernetes (Search for Journal in Brave)

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

zbMATH Keywords

gradient methodsparallel programmingcybernetics

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30)

Uses Software

• SNOPT
• CFSQP

Cites Work

• Globally convergent limited memory bundle method for large-scale nonsmooth optimization
• Solving irregular econometric and mathematical optimization problems with a genetic hybrid algorithm
• Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
• A multipurpose parallel genetic hybrid algorithm for nonlinear nonconvex programming problems
• A generalized dual phase-2 simplex algorithm.
• Heterogeneous distribution of computations solving linear algebra problems on networks of heterogeneous computers
• Solving large MINLPs on computational grids
• Performance and modularity benefits of message-driven execution
• A distributed parallel genetic algorithm for solving optimal growth models
• Speedup and scalability analysis of master-slave applications on large heterogeneous clusters
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm
• A flexible platform for mixed‐integer non‐linear programming problems
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Designing a superstructure for parametric search for optimal search spaces in non‐trivial optimization problems
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming

This page was built for publication: Concurrent processing of mixed‐integer non‐linear programming problems