The Homotopy Principle and Algorithms for Linear Programming
From MaRDI portal
Recommendations
Cited in
(14)- Homotopy techniques in linear programming
- A new simple homotopy algorithm for linear programming. I
- Deriving potential functions via a symmetry principle for nonlinear equations
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- A natural notion of morphism for linear programming problems
- The implementation of linear programming algorithms based on homotopies
- MIPping closures: An instant survey
- Optimizing over the split closure
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Homotopy methods for convex optimization
- The relation between the path of centers and Smale's regularization of the linear programming problem
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
This page was built for publication: The Homotopy Principle and Algorithms for Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012412)