Copertina

Validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Awoniyi, Samuel
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control 90C05
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming problem
di: Awoniyi, Samuel
Pubblicazione: (2023)

A strongly polynomial-time algorithm for the general linear programming problem
di: Awoniyi, Samuel
Pubblicazione: (2025)

A compact implementation of a recently proposed strongly polynomial-time algorithm for the general LP problem
di: Awoniyi, Samuel
Pubblicazione: (2025)

A double-pivot degenerate-robust simplex algorithm for linear programming
di: Yang, Yaguang, et al.
Pubblicazione: (2021)

On the facet pivot simplex method for linear programming
di: Yang, Yaguang
Pubblicazione: (2021)

Multiple objective linear programming over the probability simplex
di: Mifrani, Anas
Pubblicazione: (2024)

A non-iterative polynomial algorithm for linear programming
di: Jing-Yuan, Wei
Pubblicazione: (2013)

A new geometric approach to multiobjective linear programming problems
di: Kaci, Mustapha, et al.
Pubblicazione: (2022)

Multi-objective stochastic linear programming with recourse and flexible decision making
di: Hamel, Andreas H., et al.
Pubblicazione: (2024)

Topological structure and a polynomial-time solution of linear programming over the real numbers
di: Wei, Jing-Yuan
Pubblicazione: (2018)

Conditions when the problems of linear programming are algorithmically unsolvable
di: Chernov, Viktor, et al.
Pubblicazione: (2023)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
di: Barkel, Mathijs, et al.
Pubblicazione: (2026)

HPR-LP: An implementation of an HPR method for solving linear programming
di: Chen, Kaihuang, et al.
Pubblicazione: (2024)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
di: Nishioka, Akatsuki, et al.
Pubblicazione: (2023)

On generalized KKT points for the Motzkin-Straus program
di: Beretta, G., et al.
Pubblicazione: (2023)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
di: Nikolaev, Andrei V., et al.
Pubblicazione: (2022)

Linear programming for finite-horizon vector-valued Markov decision processes
di: Mifrani, Anas, et al.
Pubblicazione: (2025)

Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
di: Löhne, Andreas, et al.
Pubblicazione: (2015)

Unbelievable $O(L^{1.5})$ worst case computational complexity achieved by $spdspds$ algorithm for linear programming problem
di: Halemane, Keshava Prasad
Pubblicazione: (2014)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
di: Zhou, Junpeng, et al.
Pubblicazione: (2025)

Existence of solutions for polyhedral convex set optimization problems
di: Löhne, Andreas
Pubblicazione: (2023)

Average-case thresholds for exact regularization of linear programs
di: Friedlander, Michael P., et al.
Pubblicazione: (2025)

A solution method for arbitrary polyhedral convex set optimization problems
di: Löhne, Andreas
Pubblicazione: (2023)

A proximal splitting algorithm for generalized DC programming with applications in signal recovery
di: Pham, Tan Nhat, et al.
Pubblicazione: (2024)

Stochastic dynamic programming with non-linear discounting
di: Bäuerle, Nicole, et al.
Pubblicazione: (2020)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
di: Kanzow, Christian, et al.
Pubblicazione: (2025)

The vector linear program solver Bensolve -- notes on theoretical background
di: Löhne, Andreas, et al.
Pubblicazione: (2015)

A full splitting algorithm for fractional programs with structured numerators and denominators
di: Boţ, Radu Ioan, et al.
Pubblicazione: (2023)

Linear models of dynamic optimization with linear constraints
di: Lahiri, Somdeb
Pubblicazione: (2025)

A polynomial projective algorithm for convex feasibility problems with positive-definite constraints
di: Chubanov, Sergei
Pubblicazione: (2025)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
di: Yang, Yaguang
Pubblicazione: (2022)

Line-search and Adaptive Step Sizes for Nonconvex-strongly-concave Minimax Optimization
di: Ma, Bohao, et al.
Pubblicazione: (2026)

On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
di: Heeman, Pim, et al.
Pubblicazione: (2025)

From an Interior Point to a Corner Point: Smart Crossover
di: Ge, Dongdong, et al.
Pubblicazione: (2021)

Generalized Nash equilibrium problems with quasi-linear constraints
di: Choi, Jiyoung, et al.
Pubblicazione: (2024)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
di: Millán, R. Díaz, et al.
Pubblicazione: (2026)

Mixed-integer linearity in nonlinear optimization: a trust region approach
di: De Marchi, Alberto
Pubblicazione: (2023)

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
di: Wang, Jia, et al.
Pubblicazione: (2025)

An investigation of stochastic trust-region based algorithms for finite-sum minimization
di: Bellavia, Stefania, et al.
Pubblicazione: (2024)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
di: Guigues, Vincent, et al.
Pubblicazione: (2017)