Reducing Linear Programs into Min-max Problems
Computational Geometry
2013-11-22 v1
Authors:
Carmi Grushko
Abstract
We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.
Cite
@article{arxiv.1311.5447,
title = {Reducing Linear Programs into Min-max Problems},
author = {Carmi Grushko},
journal= {arXiv preprint arXiv:1311.5447},
year = {2013}
}
Related papers
View all related →
Programming Languages · Computer Science
Efficient Compilation of Algorithms into Compact Linear Programs
Shermin Khosravi, David Bremner
2025-09-17
Numerical Analysis · Computer Science
A Hough Transform Approach to Solving Linear Min-Max Problems
Carmi Grushko
2012-05-29
Optimization and Control · Mathematics
Next-Generation Iterative Algorithms for Large-Scale Min-Max Optimization: Design and Analysis
Sayantan Choudhury
2025-12-16
Data Structures and Algorithms · Computer Science
Using Optimization to Solve Positive LPs Faster in Parallel
Zeyuan Allen-Zhu, Lorenzo Orecchia
2016-11-15
Optimization and Control · Mathematics
Novel min-max reformulations of Linear Inverse Problems
Mohammed Rayyan Sheriff, Debasish Chatterjee
2022-12-05
Optimization and Control · Mathematics
Lower-level Duality Based Reformulation and Majorization Minimization Algorithm for Hyperparameter Optimization
He Chen, Haochen Xu, Rujun Jiang, Anthony Man-Cho So
2024-03-04
Optimization and Control · Mathematics
Limited Resource Optimal Distribution Algorithm Based on Game Iteration Method
Vilisov V. Ya
2019-05-15
Artificial Intelligence · Computer Science
Partitioned Linear Programming Approximations for MDPs
Branislav Kveton, Milos Hauskrecht
2012-06-18
Optimization and Control · Mathematics
From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming
Peyman Mohajerin Esfahani, Tobias Sutter, Daniel Kuhn, John Lygeros
2017-02-22
Information Theory · Computer Science
Adaptive Methods for Linear Programming Decoding
Mohammad H. Taghavi, Paul H. Siegel
2007-07-13
Optimization and Control · Mathematics
A Class of Linear Programs Solvable by Coordinate-Wise Minimization
Tomáš Dlask, Tomáš Werner
2020-09-15
Information Theory · Computer Science
Adaptive Linear Programming Decoding
Mohammad H. Taghavi N., Paul H. Siegel
2007-07-13
Optimization and Control · Mathematics
Linear Superiorization for Infeasible Linear Programming
Yair Censor, Yehuda Zur
2016-12-22
Artificial Intelligence · Computer Science
Optimization With Parity Constraints: From Binary Codes to Discrete Integration
Stefano Ermon, Carla P. Gomes, Ashish Sabharwal, Bart Selman
2013-09-27
Optimization and Control · Mathematics
Learning to Reformulate for Linear Programming
Xijun Li, Qingyu Qu, Fangzhou Zhu, Jia Zeng +3
2022-01-19
Optimization and Control · Mathematics
Outer-space branch-and-bound algorithm for generalized linear multiplicative programs
Bo Zhang
2024-01-03
Computational Complexity · Computer Science
Efficiently expressing feasibility problems in Linear Systems, as feasibility problems in Asymptotic-Linear-Programs
Deepak Ponvel Chermakani
2012-06-20
Optimization and Control · Mathematics
A feasible adaptive refinement algorithm for linear semi-infinite optimization
Shuxiong Wang
2021-01-26
Optimization and Control · Mathematics
Coordinate Linear Variance Reduction for Generalized Linear Programming
Chaobing Song, Cheuk Yin Lin, Stephen J. Wright, Jelena Diakonikolas
2023-04-10
Optimization and Control · Mathematics
Reduction of Linear Programming to Linear Approximation
Leonid N. Vaserstein
2007-05-23
Optimization and Control · Mathematics
A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
Bruno Machado Pacheco, Pedro Marcolin Antunes, Eduardo Camponogara, Laio Oriel Seman +3
2025-06-10
Numerical Analysis · Computer Science
An Approximate, Efficient Solver for LP Rounding
Srikrishna Sridhar, Victor Bittorf, Ji Liu, Ce Zhang +2
2013-11-19
Computational Complexity · Computer Science
A Linear Complementarity Theorem to solve any Satisfiability Problem in conjunctive normal form in polynomial time
Giacomo Patrizi
2018-01-31
Data Structures and Algorithms · Computer Science
Fast Makespan Minimization via Short ILPs
Danny Hermelin, Dvir Shabtay
2026-02-09
Optimization and Control · Mathematics
Characterization of optimization problems that are solvable iteratively with linear convergence
Foivos Alimisis
2024-06-27