On generalized bisection of 𝑛-simplices
From MaRDI portal
Publication:3127327
DOI10.1090/S0025-5718-97-00809-0zbMath0863.51018MaRDI QIDQ3127327
Publication date: 8 April 1997
Published in: Mathematics of Computation (Search for Journal in Brave)
Three-dimensional polytopes (52B10) Nonconvex programming, global optimization (90C26) Polyhedra and polytopes; regular figures, division of spaces (51M20) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)
Related Items
A Weak Compatibility Condition for Newest Vertex Bisection in Any Dimension ⋮ LP-based tractable subcones of the semidefinite plus nonnegative cone ⋮ P-algorithm based on a simplicial statistical model of multimodal functions ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ An improved algorithm to test copositivity ⋮ Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision ⋮ Factorization and cutting planes for completely positive matrices by copositive projection ⋮ On the exhaustivity of simplicial partitioning ⋮ On global and local mesh refinements by a generalized conforming bisection algorithm ⋮ Pareto optimality and robustness in bi-blending problems ⋮ Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints ⋮ The semi-continuous quadratic mixture design problem: description and branch-and-bound approach ⋮ Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement ⋮ Simplicial Lipschitz optimization without the Lipschitz constant ⋮ Algorithmic copositivity detection by simplicial partition ⋮ Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms ⋮ Bisecton by global optimization revisited ⋮ On refinement of the unit simplex using regular simplices ⋮ Copositive Lyapunov functions for switched systems over cones ⋮ Longest-edge \(n\)-section algorithms: properties and open problems ⋮ Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A course in triangulations for solving equations with deformations
- Computing the topological degree of a mapping in \(R^n\)
- Handbook of global optimization
- Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
- A bisection method for systems of nonlinear equations
- On the Bisection Method for Triangles
- Mesh Refinement Processes Based on the Generalized Bisection of Simplices
- A grid generator based on 4-triangles conforming mesh-refinement algorithms
- On Faster Convergence of the Bisection Method for all Triangles
- A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
- An algorithm for nonconvex programming problems
- A Proof of Convergence and an Error Bound for the Method of Bisection in R n
- A Three-Dimensional Analogue to the Method of Bisections for Solving Nonlinear Equations
- On the Shape of Tetrahedra from Bisection
