scientific article; zbMATH DE number 5007493

zbMATH Open1098.90054MaRDI QIDQ3372231FDOQ3372231

Authors: Mojca Indihar Štemberger, H. Arsham 

Publication date: 20 February 2006

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2187089
• Continuous global optimization over polyhedrons: A new introduction to optimization
• Tighter bound functions for nonconvex functions over simplexes
• A finite method for globally minimizing concave functions over unbounded polyhedral convex sets and its applications
• Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
• A unifying polyhedral approximation framework for convex optimization
• Publication:4723577
• Optimization and approximation for polyhedra in separable Hilbert spaces
• A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications
• Finite exact branch-and-bound algorithms for concave minimization over polytopes

zbMATH Keywords

linearly constrained optimizationglobal optima

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cited In (4)

• Linearly constrained global optimization: a general solution algorithm with applications.
• Title not available (Why is that?)
• Continuous global optimization over polyhedrons: A new introduction to optimization
• A validation and verification tool for global optimization solvers

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