On Interior-Point Warmstarts for Linear and Combinatorial Optimization
From MaRDI portal
Publication:3058509
DOI10.1137/080742786zbMath1206.90215OpenAlexW2071011182MaRDI QIDQ3058509
Alexander Engau, Miguel F. Anjos, Anthony Vannelli
Publication date: 3 December 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/32663fc59f643a40aac8120ce39ccf522e2ca11c
linear programmingcombinatorial optimizationinterior-point methodscutting planestravelling salesman problemwarmstartingNetlib test problems
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Combinatorial optimization (90C27)
Related Items
An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization, On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems, Using the primal-dual interior point algorithm within the branch-price-and-cut method, Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem, LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison, Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization, Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems, Primal-dual active-set methods for large-scale optimization, A new warmstarting strategy for the primal-dual column generation method, Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, Active-set prediction for interior point methods using controlled perturbations
Uses Software
