Cover Image

A non-iterative polynomial algorithm for linear programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Jing-Yuan, Wei
Format:	Preprint
Published:	2013
Subjects:	Optimization and Control 68Q15 68Q25 90C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Online Convex Optimization Using Coordinate Descent Algorithms
by: Lin, Yankai, et al.
Published: (2022)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)

A Function-Space Stability Boundary for Generalization in Interpolating Learning Systems
by: Katende, Ronald
Published: (2026)

Birkhoff interpolation models for optimization with some available derivatives
by: Larson, Jeffrey, et al.
Published: (2026)

On the Hardness of Short and Sign-Compatible Circuit Walks
by: Borgwardt, Steffen, et al.
Published: (2024)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
by: Friedland, Shmuel
Published: (2023)

On the power of linear programming for K-means clustering
by: De Rosa, Antonio, et al.
Published: (2024)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
by: Chiarini, Alberto, et al.
Published: (2024)

Optimal phase change for a generalized Grover's algorithm
by: Cardullo, Christopher, et al.
Published: (2025)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
by: Azizian, Waïss, et al.
Published: (2022)

An inertial iteratively regularized extragradient method for bilevel variational inequality problems
by: Alves, M. Marques, et al.
Published: (2025)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

A search-free $O(1/k^{3/2})$ homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities
by: Alves, M. Marques, et al.
Published: (2023)

Concave Certificates: Geometric Framework for Distributionally Robust Risk and Complexity Analysis
by: Chu, Hong T. M.
Published: (2026)

Analysis of Kernel Mirror Prox for Measure Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
by: Abdullah, Duaa, et al.
Published: (2025)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
by: Petrov, Petar P.
Published: (2022)

On semidefinite programming characterizations of the numerical radius and its dual norm
by: Friedland, Shmuel, et al.
Published: (2023)

A practical randomized trust-region method to escape saddle points in high dimension
by: Dragomir, Radu-Alexandru, et al.
Published: (2026)

Curvature-Aware Derivative-Free Optimization
by: Kim, Bumsu, et al.
Published: (2021)

Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity
by: Suvorikova, Alexandra, et al.
Published: (2026)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

Improved global performance guarantees of second-order methods in convex minimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Performance Estimation of second-order optimization methods on classes of univariate functions
by: Rubbens, Anne, et al.
Published: (2025)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
by: Yang, Xiangyu, et al.
Published: (2021)

Policy Optimization over General State and Action Spaces
by: Ju, Caleb, et al.
Published: (2022)

An Efficient Two-Sided Sketching Method for Large-Scale Tensor Decomposition Based on Transformed Domains
by: Cheng, Zhiguang, et al.
Published: (2024)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
by: Wu, Hanju, et al.
Published: (2025)

On the Hardness of the $L_1-L_2$ Regularization Problem
by: Ouyang, Yuyuan, et al.
Published: (2024)

An Efficient Stochastic First-Order Algorithm for Nonconvex-Strongly Concave Minimax Optimization beyond Lipschitz Smoothness
by: Gao, Yan, et al.
Published: (2026)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
by: Condat, Laurent, et al.
Published: (2022)

An Efficient Scaled spectral preconditioner for sequences of symmetric positive definite linear systems
by: Diouane, Youssef, et al.
Published: (2024)

On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize
by: Choi, Woocheol, et al.
Published: (2023)