Constraint Reduction for Linear Programs with Many Inequality Constraints
From MaRDI portal
Publication:5470248
DOI10.1137/050633421zbMath1112.90049OpenAlexW2072430489MaRDI QIDQ5470248
Pierre-Antoine Absil, William P. Woessner, André L. Tits
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1dd5df0b8a8bf638c63b826a5b8e3110e4989b49
linear programmingcolumn generationprimal-dual interior-point methodsconstraint reductionaffine scalingMehrotra's predictor-corrector
Related Items
Clustering-based preconditioning for stochastic programs, A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence, A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme, A constraint-reduced variant of Mehrotra's predictor-corrector algorithm, Adaptive constraint reduction for convex quadratic programming, A partial first-order affine-scaling method, A polynomial time constraint-reduced algorithm for semidefinite optimization problems, Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization, Exponential stability of equilibria of differential equations with time-dependent delay and non-Lipschitz nonlinearity, Infeasible constraint-reduced interior-point methods for linear optimization, reducedLP
Uses Software
