Rescaling Algorithms for Linear Conic Feasibility
From MaRDI portal
Publication:5119854
DOI10.1287/moor.2019.1011zbMath1455.90103arXiv1611.06427OpenAlexW3002385791WikidataQ126305510 ScholiaQ126305510MaRDI QIDQ5119854
Daniel Dadush, Giacomo Zambelli, László A. Végh
Publication date: 1 September 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.06427
Related Items (6)
Implementation of a projection and rescaling algorithm for second-order conic feasibility problems ⋮ A simple method for convex optimization in the oracle model ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ Geometric Rescaling Algorithms for Submodular Function Minimization ⋮ Computational performance of a projection and rescaling algorithm ⋮ Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
Cites Work
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- A strongly polynomial algorithm for linear systems having a binary solution
- A polynomial projection algorithm for linear feasibility problems
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- A polynomial projection-type algorithm for linear programming
- Solving conic systems via projection and rescaling
- Condition numbers for polyhedra with real number data
- An improved deterministic rescaling for linear programming algorithms
- On the von Neumann and Frank--Wolfe Algorithms with Away Steps
- A Smooth Perceptron Algorithm
- On Chubanov's Method for Linear Programming
- An Efficient Rescaled Perceptron Algorithm for Conic Systems
- Rescaled Coordinate Descent Methods for Linear Programming
- On Chubanov’s Method for Solving a Homogeneous Inequality System
- The Relaxation Method for Solving Systems of Linear Inequalities
- Finding the nearest point in A polytope
- Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
- Geometric Rescaling Algorithms for Submodular Function Minimization
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- The Duality Between the Perceptron Algorithm and the von Neumann Algorithm
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- A simple polynomial-time rescaling algorithm for solving linear programs
- A deterministic rescaled perceptron algorithm
This page was built for publication: Rescaling Algorithms for Linear Conic Feasibility
