First-order methods for the convex hull membership problem
From MaRDI portal
Publication:2106714
DOI10.1016/J.EJOR.2022.08.040OpenAlexW3211395835MaRDI QIDQ2106714
Luiz-Rafael Santos, Rafaela Filippozzi, Douglas S. Gonçalves
Publication date: 19 December 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.07720
Cites Work
- Fast projection onto the simplex and the \(l_1\) ball
- On decompositional algorithms for uniform sampling from \(n\)-spheres and \(n\)-balls
- Robust vertex enumeration for convex hulls in high dimensions
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- On the worst-case evaluation complexity of non-monotone line search algorithms
- An algorithmic separating hyperplane theorem and its applications
- A characterization theorem and an algorithm for a convex hull problem
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- On the von Neumann and Frank--Wolfe Algorithms with Away Steps
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- A family of linear programming algorithms based on an algorithm by von Neumann
- Some comments on Wolfe's ‘away step’
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- THREE CONVEX HULL THEOREMS ON TRIANGLES AND CIRCLES
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
- Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
This page was built for publication: First-order methods for the convex hull membership problem
