Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
From MaRDI portal
Publication:2250087
Recommendations
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- On branching rules for convex mixed-integer nonlinear optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
Cites work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A feasibility pump for mixed integer nonlinear programs
- A tree-search algorithm for mixed integer programming problems
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An algorithmic framework for convex mixed integer nonlinear programs
- An improved branch and bound algorithm for mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Benchmarking optimization software with performance profiles.
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Deterministic global optimization. Theory, methods and applications
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Generalized Benders decomposition
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 734930 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- Incentive compatible pricing for a service facility with joint production and congestion externalities
- Large-Scale Network Topological Optimization
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Nonlinear Programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Perspective reformulation and applications
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving mixed integer nonlinear programs by outer approximation
Cited in
(23)- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- An efficient linearization approach for mixed-integer problems
- A solution framework for linear PDE-constrained mixed-integer problems
- Outer approximation for mixed-integer nonlinear robust optimization
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
- On generalized surrogate duality in mixed-integer nonlinear programming
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- Linearization of mixed-integer products
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- scientific article; zbMATH DE number 3885661 (Why is no real title available?)
- Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming
- Convex relaxations for mixed-integer nonlinear programs
- On generalized surrogate duality in mixed-integer nonlinear programming
- On branching rules for convex mixed-integer nonlinear optimization
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- On Proximity for k-Regular Mixed-Integer Linear Optimization
- A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- Fully automated verification of linear time-invariant systems against signal temporal logic specifications via reachability analysis
- Outer approximation for generalized convex mixed-integer nonlinear robust optimization problems
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
Describes a project that uses
Uses Software
This page was built for publication: Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250087)
