Copertina

On the facet pivot simplex method for linear programming

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Yang, Yaguang
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

A double-pivot degenerate-robust simplex algorithm for linear programming
di: Yang, Yaguang, et al.
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)

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)

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

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)

HPR-LP: An implementation of an HPR method for solving linear programming
di: Chen, Kaihuang, 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)

Augmented Lagrangian methods for fully convex composite optimization
di: De Marchi, Alberto, et al.
Pubblicazione: (2025)

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

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

A cut-and-project perspective for linearized Bregman iterations
di: Dai, Yu-Hong, 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 new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
di: Käming, Isabella, et al.
Pubblicazione: (2024)

Strongly-polynomial time and validation analysis of policy gradient methods
di: Ju, Caleb, 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)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
di: Ang, Andersen, et al.
Pubblicazione: (2023)

A truncated epsilon-subdifferential method for global DC optimization
di: Bagirov, Adil M., et al.
Pubblicazione: (2025)

Parallel block coordinate descent methods with identification strategies
di: Lopes, Ronaldo, et al.
Pubblicazione: (2025)

Multi-objective stochastic linear programming with recourse and flexible decision making
di: Hamel, Andreas H., 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)

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

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

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)

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

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

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
di: Kabgani, Alireza, et al.
Pubblicazione: (2025)

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

Nonmonotone subgradient methods based on a local descent lemma
di: Aragón-Artacho, Francisco J., et al.
Pubblicazione: (2025)

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

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

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
di: Latafat, Puya, et al.
Pubblicazione: (2019)

Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
di: Ghosh, Suprova, et al.
Pubblicazione: (2025)

Implementing a unified solver for nonlinearly constrained optimization
di: Vanaret, Charlie, et al.
Pubblicazione: (2024)