A storm of feasibility pumps for nonconvex MINLP
From MaRDI portal
Publication:1925794
DOI10.1007/s10107-012-0608-xzbMath1257.90056OpenAlexW1967559983WikidataQ118165459 ScholiaQ118165459MaRDI QIDQ1925794
Leo Liberti, Andrea Lodi, Claudia D'Ambrosio, Antonio Frangioni
Publication date: 19 December 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0608-x
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Three ideas for a feasibility pump for nonconvex MINLP, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, A disjunctive cut strengthening technique for convex MINLP, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Inexact feasibility pump for mixed integer nonlinear programming, The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming, A recipe for finding good solutions to MINLPs, Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps, The Chebyshev center as an alternative to the analytic center in the feasibility pump, Time-flexible min completion time variance in a single machine by quadratic programming, Improving the Randomization Step in Feasibility Pump, Computing feasible points for binary MINLPs with MPECs, A computational study of primal heuristics inside an MI(NL)P solver, Proximity search for 0--1 mixed-integer convex programming, A primal heuristic for optimizing the topology of gas networks based on dual information, A proximal-point outer approximation algorithm, Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior, Feasibility pump for aircraft deconfliction with speed regulation, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming, Feasibility pump algorithm for sparse representation under Laplacian noise, RENS. The optimal rounding, Improving the performance of DICOPT in convex MINLP problems using a feasibility pump, A constraints-aware reweighted feasibility pump approach, Mixed integer nonlinear programming tools: a practical overview, Ten years of feasibility pump, and counting, Generalized relax-and-fix heuristic, An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints, Towards an objective feasibility pump for convex minlps
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- A recipe for finding good solutions to MINLPs
- On interval-subgradient and no-good cuts
- A feasibility pump for mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Rounding-based heuristics for nonconvex MINLPS
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Improving the feasibility pump
- The feasibility pump
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Branching and bounds tighteningtechniques for non-convex MINLP
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- Canonical Cuts on the Unit Hypercube
- The Reformulation-Optimization Software Engine
- Functional Operators (AM-21), Volume 1
- Convex analysis and global optimization
- Variable neighborhood search: Principles and applications
- Convergence of a block coordinate descent method for nondifferentiable minimization
