Copertina

A double-pivot degenerate-robust simplex algorithm for linear programming

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Yang, Yaguang, Vitor, Fabio
Natura:	Preprint
Pubblicazione:	2021
Soggetti:	Optimization and Control 90C05 90C49
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
di: Yang, Yaguang
Pubblicazione: (2021)

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

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

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

Lipschitz upper semicontinuity of linear inequality systems under full perturbations
di: Camacho, Jesús, et al.
Pubblicazione: (2025)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
di: Zhang, Rui-Jin, et al.
Pubblicazione: (2025)

A computationally efficient arc-search interior-point algorithm for nonlinear constrained optimization
di: Yang, Yaguang
Pubblicazione: (2024)

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

A Refined Proximal Algorithm for Nonconvex Multiobjective Optimization in Hilbert Spaces
di: Bento, G. C., et al.
Pubblicazione: (2024)

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
di: Hermans, Ben, et al.
Pubblicazione: (2020)

Lispchitz modulus of the argmin mapping in convex quadratic optimization
di: Cánovas, María Josefa, et al.
Pubblicazione: (2025)

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

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
di: Kabgani, Alireza, et al.
Pubblicazione: (2025)

A cut-and-project perspective for linearized Bregman iterations
di: Dai, Yu-Hong, et al.
Pubblicazione: (2024)

Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
di: Berahas, Albert S., et al.
Pubblicazione: (2025)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
di: Bollapragada, Raghu, et al.
Pubblicazione: (2025)

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
di: Chen, Liang, et al.
Pubblicazione: (2025)

The Non-Substitution Theorem, Uniqueness of Solution and Convex combinations of basic optimal solutions for linear optimization
di: Lahiri, Somdeb
Pubblicazione: (2024)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
di: Käming, Isabella, et al.
Pubblicazione: (2024)

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

Variational analysis of unbounded and discontinuous generalized eigenvalue functions with application to topology optimization
di: Nishioka, Akatsuki, et al.
Pubblicazione: (2024)

A full splitting algorithm for structured difference-of-convex programs
di: Bot, Radu Ioan, et al.
Pubblicazione: (2025)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
di: Braun, Gábor, et al.
Pubblicazione: (2024)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
di: Fang, Changjie, et al.
Pubblicazione: (2025)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
di: Rahimi, Morteza, et al.
Pubblicazione: (2024)

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

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

PANOC-lite: A simpler and more efficient algorithm for composite minimization
di: Bodard, Alexander, et al.
Pubblicazione: (2026)

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

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

Finding directional stationary points of DC programs
di: Thi, Hoai An Le, et al.
Pubblicazione: (2026)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
di: Ahookhosh, Masoud, et al.
Pubblicazione: (2019)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
di: Themelis, Andreas, et al.
Pubblicazione: (2020)

An arc-search BFGS algorithm for unconstrained nonlinear optimization problems
di: Yang, Yaguang
Pubblicazione: (2026)

Finding Short Paths on Simple Polytopes
di: Black, Alexander E., et al.
Pubblicazione: (2026)

Optimality conditions at infinity for nonsmooth minimax programming
di: Van Tuyen, Nguyen, et al.
Pubblicazione: (2024)

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

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
di: Kabgani, Alireza, et al.
Pubblicazione: (2024)

A successive difference-of-convex method for a class of two-stage nonconvex nonsmooth stochastic conic program via SVI
di: Zhang, Chao, et al.
Pubblicazione: (2026)

Complexity of an inexact stochastic SQP algorithm for equality constrained optimization
di: O'Neill, Michael J., et al.
Pubblicazione: (2026)