An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
From MaRDI portal
Recommendations
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
Cites work
- A polyhedral branch-and-cut approach to global optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Mathematical models of the delay constrained routing problem
- Mixed-integer nonlinear programs featuring ``on/off constraints
- 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
- Solving mixed integer nonlinear programs by outer approximation
Cited in
(30)- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
- Polyhedral approximation in mixed-integer convex optimization
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Reformulations for utilizing separability when solving convex MINLP problems
- Joint location and cost planning in maximum capture facility location under random utilities
- A proximal-point outer approximation algorithm
- Sparse convex optimization toolkit: a mixed-integer framework
- The supporting hyperplane optimization toolkit for convex MINLP
- A multicut outer-approximation approach for competitive facility location under random utilities
- A disjunctive cut strengthening technique for convex MINLP
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- 50 years of mixed-integer nonlinear and disjunctive programming
- On speed scaling via integer programming
- Extended formulations in mixed-integer convex programming
- Partially distributed outer approximation
- scientific article; zbMATH DE number 3900505 (Why is no real title available?)
- Hub location problem considering spoke links with incentive-dependent capacities
- Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Extended formulations in mixed integer conic quadratic programming
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
- An outer approximation method for a class of minimax convex MINLP problems
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
This page was built for publication: An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967613)
