Computational performance of a projection and rescaling algorithm

DOI10.1080/10556788.2019.1615910OpenAlexW2963592851MaRDI QIDQ5865326

Negar Soheili, Javier F. Peña

Publication date: 13 June 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.07107

zbMATH Keywords

rescalingprojection methodfeasibility probleminterior solutionscomputational performance

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical methods for mathematical programming, optimization and variational techniques (65K99)

Related Items (2)

Implementation of a projection and rescaling algorithm for second-order conic feasibility problems ⋮ Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems

Uses Software

• Matlab

Cites Work

• A strongly polynomial algorithm for linear systems having a binary solution
• A polynomial projection algorithm for linear feasibility problems
• Coverage processes on spheres and condition numbers for linear programming
• Solving conic systems via projection and rescaling
• An improved deterministic rescaling for linear programming algorithms
• An Efficient Rescaled Perceptron Algorithm for Conic Systems
• Rescaled Coordinate Descent Methods for Linear Programming
• A Problem in Geometric Probability.
• An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
• An improved version of Chubanov's method for solving a homogeneous feasibility problem
• Rescaling Algorithms for Linear Conic Feasibility
• Unifying Condition Numbers for Linear Programming
• A deterministic rescaled perceptron algorithm

This page was built for publication: Computational performance of a projection and rescaling algorithm