Advanced preprocessing techniques for linear and quadratic programming
From MaRDI portal
Publication:1412170
DOI10.1007/s00291-003-0130-xzbMath1042.90031OpenAlexW2016761488MaRDI QIDQ1412170
Publication date: 9 November 2003
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-003-0130-x
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Interior-point methods (90C51)
Related Items (19)
Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems ⋮ The practical behavior of the homogeneous self-dual formulations in interior point methods ⋮ Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms ⋮ Detecting ``dense columns in interior point methods for linear programs ⋮ Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data ⋮ On sparse matrix orderings in interior point methods ⋮ A heuristic algorithm for resource allocation/reallocation problem ⋮ Revisiting degeneracy, strict feasibility, stability, in linear programming ⋮ Screening Rules and its Complexity for Active Set Identification ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Regularization techniques in interior point methods ⋮ Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ Design of planar articulated mechanisms using branch and bound ⋮ Preprocessing and cutting planes with conflict graphs ⋮ Exploiting hardware capabilities in interior point methods ⋮ A triangulation and fill-reducing initialization procedure for the simplex algorithm ⋮ An ADMM-based interior-point method for large-scale linear programming ⋮ A heuristic approach for identification of redundant constraints in linear programming models
This page was built for publication: Advanced preprocessing techniques for linear and quadratic programming
