An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs

DOI10.1287/IJOC.1120.0545zbMath1356.90091OpenAlexW2082471977MaRDI QIDQ2967613

Hassan Hijazi, Adam Ouorou, Pierre Bonami

Publication date: 1 March 2017

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1885/66548

zbMATH Keywords

outer approximationmixed-integer nonlinear programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30)

Related Items (21)

A disjunctive cut strengthening technique for convex MINLP ⋮ Extended Formulations in Mixed-Integer Convex Programming ⋮ The supporting hyperplane optimization toolkit for convex MINLP ⋮ A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints ⋮ A multicut outer-approximation approach for competitive facility location under random utilities ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ Joint location and cost planning in maximum capture facility location under random utilities ⋮ Extended formulations in mixed integer conic quadratic programming ⋮ Sparse convex optimization toolkit: a mixed-integer framework ⋮ Lift-and-project cuts for convex mixed integer nonlinear programs ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts ⋮ A proximal-point outer approximation algorithm ⋮ Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones ⋮ Reformulations for utilizing separability when solving convex MINLP problems ⋮ On speed scaling via integer programming ⋮ Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions ⋮ Polyhedral approximation in mixed-integer convex optimization ⋮ Partially distributed outer approximation ⋮ Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions ⋮ Linearization and parallelization schemes for convex mixed-integer nonlinear optimization

Uses Software

• AMPL
• Bonmin
• Ipopt
• DICOPT
• GAMS
• LogMIP
• FilMINT
• CMU-IBM

Cites Work

• Unnamed Item
• Mixed-integer nonlinear programs featuring ``on/off constraints
• An algorithmic framework for convex mixed integer nonlinear programs
• Solving mixed integer nonlinear programs by outer approximation
• A polyhedral branch-and-cut approach to global optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Perspective reformulations of mixed integer nonlinear programs with indicator variables
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs

This page was built for publication: An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs