Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
DOI10.1137/16M1069687zbMath1371.65051arXiv1707.09891OpenAlexW2740548164MaRDI QIDQ5348468
Antonio Morsi, Martin Schmidt, Lars Schewe, Björn Geissler
Publication date: 18 August 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.09891
convergencenumerical examplespenalty methodsfeasibility pumpmixed integer nonlinear optimizationalternating direction methodsmixed integer linear optimization
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonlinear programming (90C30) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (18)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Towards an objective feasibility pump for convex minlps
- Using the analytic center in the feasibility pump
- Heuristics for convex mixed integer nonlinear programs
- Boosting the feasibility pump
- A feasibility pump for mixed integer nonlinear programs
- Feasibility pump 2.0
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Solution of general linear complementarity problems via nondifferentiable concave minimization
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A storm of feasibility pumps for nonconvex MINLP
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Feasibility Pump-like heuristics for mixed integer problems
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach
- Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Exact penalty functions in nonlinear programming
- Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
- CONOPT—A Large-Scale GRG Code
- Improving the Randomization Step in Feasibility Pump
- A New Approach to the Feasibility Pump in Mixed Integer Programming
- Benchmarking optimization software with performance profiles.
This page was built for publication: Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps