Cover Image

Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomial cases

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rada, Miroslav, Hladík, Milan, Garajová, Elif
Format:	Preprint
Published:	2017
Subjects:	Optimization and Control 65G40, 90C31
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Range of optimal values in absolute value linear programming with interval data
by: Hladík, Milan
Published: (2025)

Minimum cost network flow with interval capacities: The worst-case scenario
by: Rada, Miroslav, et al.
Published: (2026)

Stability of the linear complementarity problem properties under interval uncertainty
by: Hladík, Milan
Published: (2019)

Interval Linear Programming under Transformations: Optimal Solutions and Optimal Value Range
by: Garajová, Elif, et al.
Published: (2018)

Heuristics for the Worst Optimal Value of Interval Transportation Problems
by: Garajová, Elif Radová, et al.
Published: (2026)

Properties of the solution set of absolute value equations and the related matrix classes
by: Hladík, Milan
Published: (2022)

Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)

Stiefel optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2025)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
by: Meng, Kaiwen, et al.
Published: (2024)

Sharp bounds in perturbed smooth optimization
by: Spokoiny, Vladimir
Published: (2025)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
by: Kannan, Rohit, et al.
Published: (2022)

A new polynomially solvable class of quadratic optimization problems with box constraints
by: Hladík, Milan, et al.
Published: (2019)

Uniform-in-time propagation of chaos for consensus-based minimax algorithm
by: Bayraktar, Erhan, et al.
Published: (2026)

Adaptive Gradient Enhanced Gaussian Process Surrogates for Inverse Problems
by: Semler, Phillip, et al.
Published: (2024)

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

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

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
by: Jung, Woosuk L., et al.
Published: (2023)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
by: Turan, Evren M., et al.
Published: (2023)

Kinetic models for optimization: a unified mathematical framework for metaheuristics
by: Borghi, Giacomo, et al.
Published: (2024)

Accelerated optimization algorithms and ordinary differential equations: the convex non Euclidean case
by: Dobson, Paul, et al.
Published: (2024)

Stability analysis for set-valued optimization in Geoffroy spaces
by: Larrouy, James
Published: (2025)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
by: Li, Hanyang, et al.
Published: (2025)

A fresh look into variational analysis of $\mathcal C^2$-partly smooth functions
by: Hang, Nguyen T. V., et al.
Published: (2024)

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

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

Sensitivity analysis of an epidemic model with a mass vaccination program of a homogeneous population
by: Bargo, Ma. Cristina R.
Published: (2025)

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

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)

Forward-Backward algorithms for weakly convex problems
by: Bednarczuk, Ewa, et al.
Published: (2023)

Data selection: at the interface of PDE-based inverse problem and randomized linear algebra
by: Hellmuth, Kathrin, et al.
Published: (2025)

The adjoint state method for parametric definable optimization without smoothness or uniqueness
by: Bolte, Jérôme, et al.
Published: (2026)

Correcting Auto-Differentiation in Neural-ODE Training
by: Xu, Yewei, et al.
Published: (2023)

Second-order cone programming for distributionally robust compliance optimization of trusses considering input distribution uncertainty
by: Fujiyama, Takumi, et al.
Published: (2025)

On the role of semismoothness in the implicit programming approach to selected nonsmooth optimization problems
by: Gfrerer, Helmut, et al.
Published: (2024)

On the existence and the stability of solutions in nonconvex vector optimization
by: Van Nghi, Tran, et al.
Published: (2025)

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

Bilevel Learning via Inexact Stochastic Gradient Descent
by: Salehi, Mohammad Sadegh, et al.
Published: (2025)

Fejér* monotonicity in optimization algorithms
by: Behling, Roger, et al.
Published: (2024)

Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms
by: McRae, Andrew D.
Published: (2024)

Stability of Nonhomogeneous Split Equality and Split Feasibility Problems with Possibly Nonconvex Constraint Sets
by: Huong, Vu Thi, et al.
Published: (2024)