Four Good Reasons to Use an Interior Point Solver Within a MIP Solver

DOI10.1007/978-3-319-89920-6_22MaRDI QIDQ4685752zbMATH OpenOpenAlexFDO

Authors Timo Berthold, Michael Perregaard, Csaba Mészáros

Publication date 9 October 2018

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-89920-6_22

zbMATH Keywords

interior pointmixed integer programminganalytic centerbarrier method

Mathematics Subject Classification ID

Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)

Recommendations

• Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
• Mixed integer nonlinear programming using interior-point methods
• scientific article; zbMATH DE number 946715
• scientific article; zbMATH DE number 1341930
• scientific article; zbMATH DE number 721832
• scientific article; zbMATH DE number 409894
• Interior-point methods for linear programming: a review
• A unified view of interior point methods for linear programming
• Inner solvers for interior point methods for large scale nonlinear programming

Cites work

• scientific article; zbMATH DE number 3972641 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• A first look at picking dual variables for maximizing reduced cost fixing
• A new polynomial-time algorithm for linear programming
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• An in-out approach to disjunctive optimization
• Applications of the notion of analytic center in approximation (estimation) problems
• Boosting the feasibility pump
• Measuring the impact of primal heuristics
• On constrained optimization by adjoint based quasi-Newton methods
• Parallelization of the FICO Xpress-Optimizer
• Proximity search for 0--1 mixed-integer convex programming
• Recursive central rounding for mixed integer programs
• Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
• The BPMPD interior point solver for convex quadratic problems
• The feasibility pump
• Using the analytic center in the feasibility pump

Cited in

(4)

• Cutting plane selection with analytic centers and multiregression
• Transferring information across restarts in MIP
• Structure-driven fix-and-propagate heuristics for mixed integer programming
• A \(J\)-symmetric quasi-Newton method for minimax problems

Describes a project that uses

Uses Software

• ACCPM
• XPRESS
• FEASPUMP
• MIPLIB
• BPMPD

This page was built for publication: Four Good Reasons to Use an Interior Point Solver Within a MIP Solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685752)