Probabilistic algorithms for extreme point identification
From MaRDI portal
Recommendations
Cites work
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
- scientific article; zbMATH DE number 3591295 (Why is no real title available?)
- Lectures on Polytopes
- On the best case performance of hit and run methods for detecting necessary constraints
- Redundancy in mathematical programming. A state-of-the-art survey
- Semidefinite Programming
- The coupon-collector problem revisited — a survey of engineering problems and computational methods
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(5)- An algorithm for finding projections with extreme kurtosis
- A note on finding extreme points in multivariate space
- Identification of input random field samples causing extreme responses
- Point decisions for interval-identified parameters
- Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints
This page was built for publication: Probabilistic algorithms for extreme point identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3508860)