A storm of feasibility pumps for nonconvex MINLP
From MaRDI portal
Publication:1925794
DOI10.1007/S10107-012-0608-XzbMATH Open1257.90056OpenAlexW1967559983WikidataQ118165459 ScholiaQ118165459MaRDI QIDQ1925794FDOQ1925794
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
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Convergence of a block coordinate descent method for nondifferentiable minimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Modeling Language for Mathematical Programming
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- A feasibility pump for mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Improving the feasibility pump
- The feasibility pump
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Canonical Cuts on the Unit Hypercube
- Variable neighborhood search: Principles and applications
- Functional Operators (AM-21), Volume 1
- Convex analysis and global optimization
- Branching and bounds tighteningtechniques for non-convex MINLP
- The Reformulation-Optimization Software Engine
- Rounding-based heuristics for nonconvex MINLPS
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- A recipe for finding good solutions to MINLPs
- On interval-subgradient and no-good cuts
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
Cited In (31)
- Mixed integer nonlinear programming tools: a practical overview
- A computational study of primal heuristics inside an MI(NL)P solver
- Towards an objective feasibility pump for convex minlps
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Generalized relax-and-fix heuristic
- Matheuristics approaches for the satellite constellation design problem
- Computing feasible points for binary MINLPs with MPECs
- Improving the Randomization Step in Feasibility Pump
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
- Feasibility pump for aircraft deconfliction with speed regulation
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- A proximal-point outer approximation algorithm
- Proximity search for 0--1 mixed-integer convex programming
- A disjunctive cut strengthening technique for convex MINLP
- Ten years of feasibility pump, and counting
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
- A recipe for finding good solutions to MINLPs
- The Chebyshev center as an alternative to the analytic center in the feasibility pump
- RENS. The optimal rounding
- Inexact feasibility pump for mixed integer nonlinear programming
- A constraints-aware reweighted feasibility pump approach
- Time-flexible min completion time variance in a single machine by quadratic programming
- Three ideas for a feasibility pump for nonconvex MINLP
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- Feasibility pump algorithm for sparse representation under Laplacian noise
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
Uses Software
This page was built for publication: A storm of feasibility pumps for nonconvex MINLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925794)
