Cover Image

Range of optimal values in absolute value linear programming with interval data

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Hladík, Milan
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C30, 90C26, 65G40
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomial cases
by: Rada, Miroslav, et al.
Published: (2017)

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

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

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
by: Li, Qia, et al.
Published: (2024)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
by: Marumo, Naoki, et al.
Published: (2023)

Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches
by: Donnini, Federica, et al.
Published: (2025)

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
by: László, Szilárd Csaba
Published: (2025)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
by: Dolgopolik, M. V.
Published: (2021)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)

Stochastic Algorithms for Large-Scale Composite Optimization: the Case of Single-Shot X-FEL Imaging
by: Luke, D. Russell, et al.
Published: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
by: Xie, Lijun, et al.
Published: (2025)

Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
by: Selicato, Laura, et al.
Published: (2025)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
by: Xie, Xiyuan, et al.
Published: (2026)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
by: Brosch, Daniel, et al.
Published: (2025)

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
by: Alcantara, Jan Harold, et al.
Published: (2024)

Global optimization tailored for graphics processing units: Complete and rigorous search for large-scale nonlinear minimization
by: Zhang, Guanglu, et al.
Published: (2025)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
by: Mannel, Florian
Published: (2024)

A heavy-ball type curve search method for smooth convexly constrained optimization
by: Donnini, Federica, et al.
Published: (2026)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
by: Jin, Ruinan, et al.
Published: (2024)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
by: Millán, R. Díaz, et al.
Published: (2026)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
by: Chen, Xiaojun, et al.
Published: (2022)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
by: Monteiro, Renato D. C., et al.
Published: (2024)

A Theory of the NEPv Approach for Optimization On the Stiefel Manifold
by: Li, Ren-Cang
Published: (2023)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
by: Aguirre, Jacob M., et al.
Published: (2025)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)

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

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

Hidden convexity of quadratic systems and its application to quadratic programming
by: Huy, Nguyen Quang, et al.
Published: (2026)

A minimal face constant rank constraint qualification for reducible conic programming
by: Andreani, Roberto, et al.
Published: (2023)

A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs
by: Zhang, Hu, et al.
Published: (2022)

Solving bilevel optimization via sequential minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)

A distributed Douglas-Rachford splitting method for solving linear constrained multi-block weakly convex problems
by: Hu, Leyu, et al.
Published: (2024)

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
by: He, Xin, et al.
Published: (2026)

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