An efficient rescaled perceptron algorithm for conic systems
From MaRDI portal
Recommendations
Cited in
(15)- Solving conic systems via projection and rescaling
- A simple method for convex optimization in the oracle model
- An improved deterministic rescaling for linear programming algorithms
- A primal-dual smooth perceptron-von Neumann algorithm
- On Chubanov's Method for Linear Programming
- Geometric rescaling algorithms for submodular function minimization
- A data-independent distance to infeasibility for linear conic systems
- Rescaling algorithms for linear conic feasibility
- An Efficient Re-scaled Perceptron Algorithm for Conic Systems
- Computational performance of a projection and rescaling algorithm
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
- Implementation of a projection and rescaling algorithm for second-order conic feasibility problems
- Examples with decreasing largest inscribed ball for deterministic rescaling algorithms
- A deterministic rescaled perceptron algorithm
- A simple method for convex optimization in the oracle model
This page was built for publication: An efficient rescaled perceptron algorithm for conic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169054)