scientific article; zbMATH DE number 3852808

MaRDI QIDQ3321853zbMATH OpenFDO

Authors Balder von Hohenbalken

Publication date 1981

zbMATH Keywords

approximate algorithmsexact algorithmssimplicial decomposition algorithms

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Polytopes and polyhedra (52Bxx) Nonlinear programming (90C30)

Recommendations

• Restricted simplicial decomposition for convex constrained problems
• Simplicial algorithms for minimizing polyhedral functions
• Restricted simplicial decomposition: Computation and extensions
• Finite exact branch-and-bound algorithms for concave minimization over polytopes
• Finiteness in restricted simplicial decomposition

Cited in

(6)

• Finiteness in restricted simplicial decomposition
• Towards a closer integration of finite domain propagation and simplex-based algorithms
• \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization
• scientific article; zbMATH DE number 3852781 (Why is no real title available?)
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints

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 Q3321853)