Copertina

On the optimal pivot path of simplex method for linear programming based on reinforcement learning

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Anqi, Guo, Tiande, Han, Congying, Li, Bonan, Li, Haoran
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the facet pivot simplex method for linear programming II: a linear iteration bound
di: Yang, Yaguang
Pubblicazione: (2022)

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

Relating Checkpoint Update Probabilities to Momentum Parameters in Single-Loop Variance Reduction Methods
di: Liu, Hai, et al.
Pubblicazione: (2026)

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles
di: Zhang, Shunzhi, et al.
Pubblicazione: (2026)

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

Inverse reinforcement learning by expert imitation for the stochastic linear-quadratic optimal control problem
di: Sun, Zhongshi, et al.
Pubblicazione: (2024)

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

Scaling policy iteration based reinforcement learning for unknown discrete-time linear systems
di: Pang, Zhen, et al.
Pubblicazione: (2024)

On the optimal objective value of random linear programs
di: Bakhshi, Marzieh, et al.
Pubblicazione: (2024)

A geometric simplex method in infinite-dimensional spaces
di: Smith, Robert L, et al.
Pubblicazione: (2026)

Automatic driving path plan based on iterative and triple optimization method
di: Yinyang, Yang, et al.
Pubblicazione: (2022)

A vector linear programming approach for certain global optimization problems
di: Ciripoi, Daniel, et al.
Pubblicazione: (2017)

A model reduction method based on nonlinear optimization for multiscale stochastic optimal control problems
di: Ma, Lingling, et al.
Pubblicazione: (2025)

A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme
di: Wei, Jiazhen, et al.
Pubblicazione: (2025)

Fast projection onto the intersection of simplex and singly linear constraint and its generalized Jacobian
di: Zhou, Weimi, et al.
Pubblicazione: (2023)

Learning to control inexact Benders decomposition via reinforcement learning
di: Li, Zhe, et al.
Pubblicazione: (2025)

A non-zero-sum game with reinforcement learning under mean-variance framework
di: Guo, Junyi, et al.
Pubblicazione: (2025)

Continuous-time reinforcement learning for optimal switching over multiple regimes
di: Huang, Yijie, et al.
Pubblicazione: (2025)

Independent policy gradient-based reinforcement learning for economic and reliable energy management of multi-microgrid systems
di: Hu, Junkai, et al.
Pubblicazione: (2025)

An efficient sieving based secant method for sparse optimization problems with least-squares constraints
di: Li, Qian, et al.
Pubblicazione: (2023)

Model-free stochastic linear quadratic design by semidefinite programming
di: Guo, Jing, et al.
Pubblicazione: (2024)

Enhancing finite-difference based derivative-free optimization methods with machine learning
di: Taminiau, Timothé, et al.
Pubblicazione: (2025)

A matrix-free interior point continuous trajectory for linearly constrained convex programming
di: Qian, Xun, et al.
Pubblicazione: (2024)

Bounds for the number of basic feasible solutions generated by the simplex method with the largest distance rule
di: Kitahara, Tomonari
Pubblicazione: (2025)

A learning-based mathematical programming formulation for the automatic configuration of optimization solvers
di: Iommazzo, Gabriele, et al.
Pubblicazione: (2024)

An adaptive linearized alternating direction multiplier method with a relaxation step for convex programming
di: Wang, Boran
Pubblicazione: (2024)

A strong second-order sequential optimality condition for nonlinear programming problems
di: Li, Huimin, et al.
Pubblicazione: (2025)

ADMM-based Bilevel Descent Aggregation Algorithm for Sparse Hyperparameter Selection
di: Xiao, Yunhai, et al.
Pubblicazione: (2026)

An inexact variable metric proximal linearization method for composite optimization on manifolds
di: He, Hao, et al.
Pubblicazione: (2025)

On optimal tracking portfolio in incomplete markets: The reinforcement learning approach
di: Bo, Lijun, et al.
Pubblicazione: (2023)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
di: Bai, Yikun
Pubblicazione: (2024)

Shell-infill composite structure design based on a hybrid explicit-implicit topology optimization method
di: Guo, Yilin, et al.
Pubblicazione: (2024)

A point cloud reconstruction method based on uncertainty feature enhancement for aerodynamic shape optimization
di: Li, Junlin, et al.
Pubblicazione: (2025)

On the feasibility of generalized inverse linear programs
di: Buchheim, Christoph, et al.
Pubblicazione: (2025)

Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
di: Yamakawa, Yuya
Pubblicazione: (2025)

Classical solution to second-order Hamilton-Jacobi-Bellman equation and optimal feedback control for linear-convex problem
di: Li, Jinghua, et al.
Pubblicazione: (2025)

A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity
di: Feng, Fuxiaoyue, et al.
Pubblicazione: (2024)

Model-free $H_{\infty}$ control of Itô stochastic system via off-policy reinforcement learning
di: Guo, Jing Guo Jing, et al.
Pubblicazione: (2024)

Statistically consistent inverse optimal control for discrete-time indefinite linear-quadratic systems
di: Zhang, Han, et al.
Pubblicazione: (2022)

Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
di: Nabou, Yassine, et al.
Pubblicazione: (2025)