Hull-volume with applications to convergence analysis

DOI10.1007/S10957-011-9959-3zbMATH Open1256.90041OpenAlexW2014363511MaRDI QIDQ438780FDOQ438780

Authors: A. B. Levy 

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

Recommendations

• Stationarity and convergence in reduce-or-retreat minimization.
• On volumes of bounded convex sets
• Publication:3484281
• On geometry and convergence of a class of simplicial covers
• Publication:4723577

zbMATH Keywords

simplexconvergence analysisconvex hullnumerical optimizationpolytopehull-volume estimates

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Cites Work

• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
• Convex Analysis
• Lectures on Polytopes
• Title not available (Why is that?)
• Two Algorithms for Determining Volumes of Convex Polyhedra
• Polytope Volume Computation
• Computing Volumes of Polyhedra
• Lectures in geometric combinatorics
• Title not available (Why is that?)
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
• A new view on some characterizations of simplices
• Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
• Finding simplicial subdivisions of polytopes

Uses Software

• fminsearch

This page was built for publication: Hull-volume with applications to convergence analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438780)