Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
From MaRDI portal
(Redirected from Publication:2124807)
Recommendations
Cites work
- scientific article; zbMATH DE number 1101647 (Why is no real title available?)
- A branch-and-cut algorithm for mixed-integer bilinear programming
- A polyhedral branch-and-cut approach to global optimization
- A recipe for finding good solutions to MINLPs
- A reformulation framework for global optimization
- A storm of feasibility pumps for nonconvex MINLP
- A tree-search algorithm for mixed integer programming problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Deterministic global optimization in nonlinear optimal control problems
- Deterministic global optimization using interval constraint propagation techniques
- Editorial: Reformulation techniques in mathematical programming
- Generalized Benders decomposition
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- Interval analysis on directed acyclic graphs for global optimization
- JuMP: a modeling language for mathematical optimization
- Juniper: an open-source nonlinear branch-and-bound solver in Julia
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Mixed integer nonlinear programming tools: an updated practical overview
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- Piecewise linear approximation of functions of two variables in MILP models
- Piecewise polyhedral formulations for a multilinear term
- Piecewise-linear approximations of multidimensional functions
- Pyomo -- optimization modeling in Python
- ROSE
- Reformulations for utilizing separability when solving convex MINLP problems
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- SUSPECT: MINLP special structure detector for Pyomo
- Solving mixed integer nonlinear programs by outer approximation
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Some transformation techniques with applications in global optimization
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- The feasibility pump
- The global solver in the LINDO API
- Three ideas for a feasibility pump for nonconvex MINLP
- Using regularization and second order information in outer approximation for convex MINLP
Cited in
(8)- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- Optimization and analysis of three-part tariff pricing strategies
- The supporting hyperplane optimization toolkit for convex MINLP
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- scientific article; zbMATH DE number 4070220 (Why is no real title available?)
- Derivative-free approaches for chance-constrained problems with right-hand side uncertainty
- Polyhedral approximation in mixed-integer convex optimization
- Preface to the special issue dedicated to the 6th world congress on global optimization held in Metz, France, July 8--10, 2019
Describes a project that uses
Uses Software
This page was built for publication: Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124807)
