Computing feasible points for binary MINLPs with MPECs
type: Item
instance of: scholarly article
title: Computing feasible points for binary MINLPs with MPECs
zbMATH Open document ID: 1411.90008
author: Lars Schewe
author: Martin Schmidt
published in: Mathematical Programming Computation
publication date: 2019-05-03T00:00:00Z
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7050496
zbMATH Keywords: mixed-integer nonlinear optimization
zbMATH Keywords: MINLP
zbMATH Keywords: MPEC
zbMATH Keywords: complementarity constraints
zbMATH Keywords: primal heuristic
describes a project that uses: MIPLIB
describes a project that uses: BARON
describes a project that uses: MINLPLib
describes a project that uses: SCIP
describes a project that uses: CONOPT
describes a project that uses: GAMS
describes a project that uses: FEASPUMP
describes a project that uses: Ipopt
describes a project that uses: LocalSolver
describes a project that uses: SNOPT
MaRDI profile type: Publication
full work available at URL: s12532-018-0141-x
OpenAlex ID: W2888211270
cites work: SCIP: solving constraint integer programs
cites work: LocalSolver 1.x: A black-box local-search solver for 0-1 programming
cites work: Undercover: a primal MINLP heuristic exploring a largest sub-MIP
cites work: Extending a CIP Framework to Solve MIQCPs
cites work: A feasibility pump for mixed integer nonlinear programs
cites work: Heuristics for convex mixed integer nonlinear programs
cites work: A storm of feasibility pumps for nonconvex MINLP
cites work: Benchmarking optimization software with performance profiles.
cites work: CONOPT—A Large-Scale GRG Code
cites work: A special newton-type optimization method
cites work: Local branching
cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
cites work: Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
cites work: A recipe for finding good solutions to MINLPs
cites work: Mathematical Programs with Equilibrium Constraints
cites work: Rounding-based heuristics for nonconvex MINLPS
cites work: Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
cites work: A Primal Heuristic for Nonsmooth Mixed Integer Nonlinear Optimization
cites work: Chapter 9: An MPEC based heuristic
cites work: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
cites work: On NCP-functions
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Scatter search and local NLP solvers: a multistart framework for global optimization
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
cites work: Optimality conditions for bilevel programming problems
Wikidata QID: Q129342618
DOI: 10.1007/S12532-018-0141-X
description: scientific article; zbMATH DE number 7050496