Computing feasible points for binary MINLPs with MPECs
From MaRDI portal
Publication:1741127
DOI10.1007/s12532-018-0141-xzbMath1411.90008OpenAlexW2888211270WikidataQ129342618 ScholiaQ129342618MaRDI QIDQ1741127
Publication date: 3 May 2019
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-018-0141-x
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Solving binary-constrained mixed complementarity problems using continuous reformulations ⋮ Complementarity-based nonlinear programming techniques for optimal mixing in gas networks ⋮ Maximizing the storage capacity of gas networks: a global MINLP approach
Uses Software
Cites Work
- A recipe for finding good solutions to MINLPs
- Heuristics for convex mixed integer nonlinear programs
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- SCIP: solving constraint integer programs
- A feasibility pump for mixed integer nonlinear programs
- On NCP-functions
- Local branching
- Rounding-based heuristics for nonconvex MINLPS
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A storm of feasibility pumps for nonconvex MINLP
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization
- Extending a CIP Framework to Solve MIQCPs
- CONOPT—A Large-Scale GRG Code
- A special newton-type optimization method
- Optimality conditions for bilevel programming problems
- A Primal Heuristic for Nonsmooth Mixed Integer Nonlinear Optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Chapter 9: An MPEC based heuristic
- Mathematical Programs with Equilibrium Constraints
- Benchmarking optimization software with performance profiles.
