Three ideas for a feasibility pump for nonconvex MINLP

@article{Belotti2017ThreeIF,
  title={Three ideas for a feasibility pump for nonconvex MINLP},
  author={Pietro Belotti and Timo Berthold},
  journal={Optimization Letters},
  year={2017},
  volume={11},
  pages={3-15}
}
We describe an implementation of the Feasibility Pump heuristic for nonconvex MINLPs. Our implementation takes advantage of three novel techniques, which we discuss here: a hierarchy of procedures for obtaining an integer solution, a generalized definition of the distance function that takes into account the nonlinear character of the problem, and the insertion of linearization cuts for nonconvex constraints at every iteration. We implemented this new variant of the Feasibility Pump as part of… 

Polyhedral Approximation Strategies in Nonconvex Mixed-Integer Nonlinear Programming*

Some extensions to SHOT are discussed that significantly extend its applicability to nonconvex problems, including utilizing convexity detection for selecting the nonlinearities to linearize, lifting reformulations for special classes of functions, feasibility relaxations for infeasible subproblems and adding objective cuts to force the search for better feasible solutions.

Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT

Some extensions to SHOT are discussed that significantly extend its applicability to nonconvex problems, including utilizing convexity detection for selecting the nonlinearities to linearize, lifting reformulations for special classes of functions, feasibility relaxations for infeasible subproblems and adding objective cuts to force the search for better feasible solutions.

Ten years of feasibility pump, and counting

An overview of the diverse Feasibility Pump literature that has been presented over the last decade is provided.

Feasibility Pump Algorithm for Sparse Representation under Laplacian Noise

The Feasibility Pump recovers the sparse representation of signals affected by Laplacian noise with good accuracy while using a very small computation time when compared with other mixed integer methods.

Integrality gap minimization heuristics for binary mixed integer nonlinear programming

Two feasibility heuristics for binary mixed integer nonlinear programming are presented based on the solution of integrality gap minimization problems with a space partitioning scheme defined over the integer variables of the problem addressed.

References

SHOWING 1-10 OF 47 REFERENCES

Rounding-based heuristics for nonconvex MINLPs

A feasibility heuristic that aims at finding an initial feasible solution and an improvement heuristic, whose purpose is to search for an improved solution within the neighborhood of a given point, which differ in the choice of the point to be rounded.

A storm of feasibility pumps for nonconvex MINLP

A remarkable twist of feasibility pump algorithms is that, unlike most previous successive projection methods from the literature, projection is “naturally” taken in two different norms in the two different subproblems.

A recipe for finding good solutions to MINLPs

A general-purpose heuristic based on Variable Neighborhood Search, Local Branching, a local Nonlinear Programming algorithm and Branch-and-Bound that can employ all NLP/MINLP solvers with an AMPL interface as the main search tools is presented.

Undercover: a primal MINLP heuristic exploring a largest sub-MIP

Undercover is presented, a primal heuristic for nonconvex mixed-integer nonlinear programs (MINLPs) that explores a mixed- integer linear subproblem (sub-MIP) of a given MINLP that nicely complements existing root-node heuristics in different state-of-the-art solvers and helps to significantly improve the overall performance of the MINLP solver SCIP.

A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach

This work starts by interpreting the Feasibility Pump as a Frank-Wolfe method applied to a nonsmooth concave merit function, and identifies some merit functions belonging to this class and dene a general class of functions that can be included in the FeAsibility Pump scheme for measuring solution integrality.

Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility

A Feasibility Pump for mixed integer nonlinear programs

An algorithm for finding a feasible solution to a convex mixed integer nonlinear program that alternates between solving nonlinear programs and mixed integer linear programs is presented.

Heuristics for convex mixed integer nonlinear programs

Diving heuristics, the Feasibility Pump, and Relaxation Induced Neighborhood Search can be adapted in the context of mixed integer nonlinear programming to help find feasible solutions faster and reduce the total solution time of the branch-and-bound algorithm.

A Local Branching Heuristic for MINLPs

Local branching is an improvement heuristic, developed within the context of branch-and-bound algorithms for MILPs, which has proved to be very effective in practice. For the binary case, it is based

Feasibility pump 2.0

This paper investigates the use of a diving-like procedure based on rounding and constraint propagation—a basic tool in Constraint Programming, and shows that the new approach produces a substantial improvement of the FP success rate.