Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
type: Item
instance of: scholarly article
title: Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
zbMATH Open document ID: 1487.90491
author: Yanyan Li
published in: Computational Optimization and Applications
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7490079
zbMATH Keywords: convex MINLP
zbMATH Keywords: linearization techniques
zbMATH Keywords: branch-and-bound
zbMATH Keywords: outer approximation
zbMATH Keywords: shared-memory parallel
describes a project that uses: SCIP
describes a project that uses: Gurobi
describes a project that uses: CPLEX
describes a project that uses: XPRESS
describes a project that uses: MINLPLib
describes a project that uses: Ipopt
describes a project that uses: ANTIGONE
describes a project that uses: LINDO
describes a project that uses: SHOT
describes a project that uses: MINOTAUR
describes a project that uses: UG
describes a project that uses: BARON
describes a project that uses: FilMINT
describes a project that uses: CHiPPS
describes a project that uses: ParaSCIP
describes a project that uses: ParaLEX
describes a project that uses: Muriqui
describes a project that uses: PEBBL
describes a project that uses: Couenne
describes a project that uses: SYMPHONY
describes a project that uses: Bonmin
describes a project that uses: LINDOGlobal
MaRDI profile type: Publication
full work available at URL: s10589-021-00335-x
OpenAlex ID: W4205553009
cites work: FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
cites work: Conflict analysis in mixed integer programming
cites work: SCIP: solving constraint integer programs
cites work: Presolve Reductions in Mixed Integer Programming
cites work: Branching rules revisited
cites work: On the solution of traveling salesman problems
cites work: Mixed-integer nonlinear optimization
cites work: A computational study of primal heuristics inside an MI(NL)P solver
cites work: Parallelization of the FICO Xpress-Optimizer
cites work: Progress in computational mixed integer programming -- a look back from the other side of the tipping point
cites work: An algorithmic framework for convex mixed integer nonlinear programs
cites work: Heuristics for convex mixed integer nonlinear programs
cites work: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
cites work: MINLPLib -- a collection of test models for mixed-integer nonlinear programming
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Benchmarking optimization software with performance profiles.
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: Generalized Benders decomposition
cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming
cites work: PEBBL: an object-oriented framework for scalable parallel branch and bound
cites work: An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
cites work: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
cites work: The global solver in the LINDO API
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: Reformulations for utilizing separability when solving convex MINLP problems
cites work: Minotaur: a mixed-integer nonlinear optimization toolkit
cites work: An overview of MINLP algorithms and their implementation in Muriqui optimizer
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
cites work: Q4235027
cites work: BARON: A general purpose global optimization software package
cites work: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
cites work: The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound
cites work: ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
cites work: FiberSCIP—A Shared Memory Parallelization of SCIP
cites work: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: Experiments with conflict analysis in mixed integer programming

Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (cites work)
cites work: Computational experience with a software framework for parallel integer programming

Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (DOI)
DOI: 10.1007/S10589-021-00335-X