On the facet pivot simplex method for linear programming II: a linear iteration bound
Fuente:
arXiv
Saved in:
| Main Author: | Yang, Yaguang |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the facet pivot simplex method for linear programming
by: Yang, Yaguang
Published: (2021)
by: Yang, Yaguang
Published: (2021)
A double-pivot degenerate-robust simplex algorithm for linear programming
by: Yang, Yaguang, et al.
Published: (2021)
by: Yang, Yaguang, et al.
Published: (2021)
On the optimal pivot path of simplex method for linear programming based on reinforcement learning
by: Li, Anqi, et al.
Published: (2022)
by: Li, Anqi, et al.
Published: (2022)
Multiple objective linear programming over the probability simplex
by: Mifrani, Anas
Published: (2024)
by: Mifrani, Anas
Published: (2024)
Outer-space branch-and-bound algorithm for generalized linear multiplicative programs
by: Zhang, Bo
Published: (2023)
by: Zhang, Bo
Published: (2023)
Computing stabilizing feedback gains for stochastic linear systems via policy iteration method
by: Zhang, Xinpei, et al.
Published: (2025)
by: Zhang, Xinpei, et al.
Published: (2025)
Fast projection onto the intersection of simplex and singly linear constraint and its generalized Jacobian
by: Zhou, Weimi, et al.
Published: (2023)
by: Zhou, Weimi, et al.
Published: (2023)
An adaptive linearized alternating direction multiplier method with a relaxation step for convex programming
by: Wang, Boran
Published: (2024)
by: Wang, Boran
Published: (2024)
Sensitivity analysis for linear changes of the constraint matrix of a (mixed-integer) linear program
by: Derval, Guillaume, et al.
Published: (2024)
by: Derval, Guillaume, et al.
Published: (2024)
On the feasibility of generalized inverse linear programs
by: Buchheim, Christoph, et al.
Published: (2025)
by: Buchheim, Christoph, et al.
Published: (2025)
Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods
by: Liao, Feng-Yi, et al.
Published: (2023)
by: Liao, Feng-Yi, et al.
Published: (2023)
A non-iterative polynomial algorithm for linear programming
by: Jing-Yuan, Wei
Published: (2013)
by: Jing-Yuan, Wei
Published: (2013)
A robust BFGS algorithm for unconstrained nonlinear optimization problems
by: Yang, Yaguang
Published: (2012)
by: Yang, Yaguang
Published: (2012)
Characterization of optimization problems that are solvable iteratively with linear convergence
by: Alimisis, Foivos
Published: (2024)
by: Alimisis, Foivos
Published: (2024)
Solving a linear program via a single unconstrained minimization
by: Otemissov, Adilet, et al.
Published: (2025)
by: Otemissov, Adilet, et al.
Published: (2025)
On the optimal objective value of random linear programs
by: Bakhshi, Marzieh, et al.
Published: (2024)
by: Bakhshi, Marzieh, et al.
Published: (2024)
Scaling policy iteration based reinforcement learning for unknown discrete-time linear systems
by: Pang, Zhen, et al.
Published: (2024)
by: Pang, Zhen, et al.
Published: (2024)
Sensitivity analysis of multiobjective linear programming from a geometric perspective
by: Kaci, Mustapha
Published: (2024)
by: Kaci, Mustapha
Published: (2024)
A preconditioner for solving linear programming problems with dense columns
by: Villalba, Catalina J., et al.
Published: (2024)
by: Villalba, Catalina J., et al.
Published: (2024)
Model-free stochastic linear quadratic design by semidefinite programming
by: Guo, Jing, et al.
Published: (2024)
by: Guo, Jing, et al.
Published: (2024)
Shannon-and von neumann-entropy regularizations of linear and semidefinite programs
by: Chhatoi, Saroj Prasad, et al.
Published: (2025)
by: Chhatoi, Saroj Prasad, et al.
Published: (2025)
A Facet Enumeration Algorithm for Convex Polytopes
by: Yang, Yaguang
Published: (2019)
by: Yang, Yaguang
Published: (2019)
A geometric simplex method in infinite-dimensional spaces
by: Smith, Robert L, et al.
Published: (2026)
by: Smith, Robert L, et al.
Published: (2026)
Mixed-integer linear programming approaches for tree partitioning of power networks
by: Lan, Leon, et al.
Published: (2021)
by: Lan, Leon, et al.
Published: (2021)
Exploiting the polyhedral geometry of stochastic linear bilevel programming
by: Muñoz, Gonzalo, et al.
Published: (2022)
by: Muñoz, Gonzalo, et al.
Published: (2022)
A vector linear programming approach for certain global optimization problems
by: Ciripoi, Daniel, et al.
Published: (2017)
by: Ciripoi, Daniel, et al.
Published: (2017)
Efficient modeling of chemotherapy regimens using mixed-integer linear programming
by: Billionnet, Alain
Published: (2026)
by: Billionnet, Alain
Published: (2026)
An efficient mixed-integer linear programming formulation for solving influence diagrams
by: Terho, Topias, et al.
Published: (2026)
by: Terho, Topias, et al.
Published: (2026)
Quantum speedups for linear programming via interior point methods
by: Apers, Simon, et al.
Published: (2023)
by: Apers, Simon, et al.
Published: (2023)
A reformulation to Embedding a Neural Network in a linear program without integer variables
by: -de-Alba, Héctor G., et al.
Published: (2024)
by: -de-Alba, Héctor G., et al.
Published: (2024)
Optimal breakpoint selection method for piecewise linear approximation
by: Liu, Shaojun
Published: (2024)
by: Liu, Shaojun
Published: (2024)
Measurement incompatibility and quantum steering via linear programming
by: Porto, Lucas E. A., et al.
Published: (2025)
by: Porto, Lucas E. A., et al.
Published: (2025)
Event-triggered robust control of linear systems: Sliding mode cone method
by: Jiang, Bangxin, et al.
Published: (2025)
by: Jiang, Bangxin, et al.
Published: (2025)
A matrix-free interior point continuous trajectory for linearly constrained convex programming
by: Qian, Xun, et al.
Published: (2024)
by: Qian, Xun, et al.
Published: (2024)
Accelerated linearized alternating direction method of multipliers with Nesterov extrapolation
by: He, X., et al.
Published: (2023)
by: He, X., et al.
Published: (2023)
Lower bounds for ranking-based pivot rules
by: Disser, Yann, et al.
Published: (2025)
by: Disser, Yann, et al.
Published: (2025)
Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs
by: Hinder, Oliver
Published: (2023)
by: Hinder, Oliver
Published: (2023)
On the tightness of linear relaxations of alternative mixed integer programming formulations for the generator maintenance scheduling problem
by: Andrade, Tiago
Published: (2025)
by: Andrade, Tiago
Published: (2025)
An arc-search BFGS algorithm for unconstrained nonlinear optimization problems
by: Yang, Yaguang
Published: (2026)
by: Yang, Yaguang
Published: (2026)
On Berinde's method for comparing iterative processes
by: Zalinescu, C.
Published: (2018)
by: Zalinescu, C.
Published: (2018)
Similar Items
-
On the facet pivot simplex method for linear programming
by: Yang, Yaguang
Published: (2021) -
A double-pivot degenerate-robust simplex algorithm for linear programming
by: Yang, Yaguang, et al.
Published: (2021) -
On the optimal pivot path of simplex method for linear programming based on reinforcement learning
by: Li, Anqi, et al.
Published: (2022) -
Multiple objective linear programming over the probability simplex
by: Mifrani, Anas
Published: (2024) -
Outer-space branch-and-bound algorithm for generalized linear multiplicative programs
by: Zhang, Bo
Published: (2023)