Hull-volume with applications to convergence analysis
From MaRDI portal
Publication:438780
DOI10.1007/s10957-011-9959-3zbMath1256.90041OpenAlexW2014363511MaRDI QIDQ438780
Publication date: 31 July 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9959-3
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
- A new view on some characterizations of simplices
- Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
- Polytope Volume Computation
- Computing Volumes of Polyhedra
- Finding simplicial subdivisions of polytopes
- Two Algorithms for Determining Volumes of Convex Polyhedra
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Lectures on Polytopes
- Convex Analysis
This page was built for publication: Hull-volume with applications to convergence analysis