An algorithmic framework for MINLP with separable non-convexity
From MaRDI portal
Publication:2897302
DOI10.1007/978-1-4614-1927-3_11zbMATH Open1242.90124OpenAlexW48802902MaRDI QIDQ2897302FDOQ2897302
Authors: Claudia D'Ambrosio, Jon Lee, Andreas Wächter 
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1927-3_11
Recommendations
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Handling separable non-convexities using disjunctive cuts
- An Algorithm for Separable Nonconvex Programming Problems
- Algorithm for solution of convex MINLP problems
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- BARON: A general purpose global optimization software package
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- LaGO -- an object oriented library for solving MINLPs
- A Modeling Language for Mathematical Programming
- An algorithmic framework for convex mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- Writing global optimization software
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
Cited In (12)
- Title not available (Why is that?)
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
- An Algorithm for Separable Nonconvex Programming Problems
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- Reformulations for utilizing separability when solving convex MINLP problems
- Sequence of polyhedral relaxations for nonlinear univariate functions
- On global optimization with indefinite quadratics
- Algorithm for solution of convex MINLP problems
- Handling separable non-convexities using disjunctive cuts
- Valid inequalities for separable concave constraints with indicator variables
- Strengthening the sequential convex MINLP technique by perspective reformulations
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Uses Software
This page was built for publication: An algorithmic framework for MINLP with separable non-convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897302)
