First-order methods for the convex hull membership problem
From MaRDI portal
Publication:2106714
Recommendations
- A characterization theorem and an algorithm for a convex hull problem
- Three convex hull theorems on triangles and circles
- Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
- scientific article; zbMATH DE number 1156645
- An algorithmic separating hyperplane theorem and its applications
Cites work
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
- A characterization theorem and an algorithm for a convex hull problem
- A family of linear programming algorithms based on an algorithm by von Neumann
- Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
- An algorithmic separating hyperplane theorem and its applications
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Fast projection onto the simplex and the l₁ ball
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On decompositional algorithms for uniform sampling from \(n\)-spheres and \(n\)-balls
- On the von Neumann and Frank-Wolfe algorithms with away steps
- On the worst-case evaluation complexity of non-monotone line search algorithms
- Robust vertex enumeration for convex hulls in high dimensions
- Some comments on Wolfe's ‘away step’
- Three convex hull theorems on triangles and circles
Cited in
(2)
This page was built for publication: First-order methods for the convex hull membership problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106714)
