Bisecton by global optimization revisited

DOI10.1007/s10957-009-9610-8zbMath1184.90129OpenAlexW2152090939MaRDI QIDQ965055

Reiner Horst

Publication date: 21 April 2010

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-009-9610-8

zbMATH Keywords

global optimizationnonconvex programmingfinite element methodsmathematical programmingsubdivisionscomputational convexitytriangulation of polytopes

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (3)

Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ Simplicial Lipschitz optimization without the Lipschitz constant ⋮ On refinement of the unit simplex using regular simplices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• On-line and off-line vertex enumeration by adjacency lists
• Subdivision of simplices relative to a cutting plane and finite concave minimization
• On generalized bisection of 𝑛-simplices
• A note on the convergence of an algorithm for nonconvex programming problems
• An algorithm for nonconvex programming problems
• Introduction to global optimization.

This page was built for publication: Bisecton by global optimization revisited