Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1857671
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Global optimization and constraint satisfaction: the branch-and-reduce approach
- scientific article; zbMATH DE number 1101647
Cited in
(only showing first 100 items - show all)- Inexact solution of NLP subproblems in MINLP
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- Global optimization in stabilizing controller design
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- On minimal valid inequalities for mixed integer conic programs
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- On the implementation of a global optimization method for mixed-variable problems
- Mixed integer nonlinear programming tools: a practical overview
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- QPLIB: a library of quadratic programming instances
- Relaxations of factorable functions with convex-transformable intermediates
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- A primal heuristic for optimizing the topology of gas networks based on dual information
- The optimization test environment
- Valid inequalities and convex hulls for multilinear functions
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Alternative branching rules for some nonconvex problems
- Validation of nominations in gas network optimization: models, methods, and solutions
- A mean-risk mixed integer nonlinear program for transportation network protection
- A general purpose exact solution method for mixed integer concave minimization problems
- Computing feasible points for binary MINLPs with MPECs
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- An algorithmic framework for convex mixed integer nonlinear programs
- Global optimization of semi-infinite programs via restriction of the right-hand side
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- Valid inequalities for the topology optimization problem in gas network design
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- A new framework to relax composite functions in nonlinear programs
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- Extended reverse-convex programming: an approximate enumeration approach to global optimization
- Theoretical and computational results about optimality-based domain reductions
- A review of recent advances in global optimization
- Molecular distance geometry methods: from continuous to discrete
- High order strong stability preserving time discretizations
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- Maximum feasible subsystems of distance geometry constraints
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- The problems of non-convex quadratic programming related to phased antenna arrays optimization
- Supply capacity acquisition and allocation with uncertain customer demands
- The demand weighted vehicle routing problem
- Global optimization of nonconvex problems with multilinear intermediates
- An algorithm for nonlinear optimization problems with binary variables
- New methods for calculating \(\alpha\)BB-type underestimators
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Global optimization of explicit strong-stability-preserving Runge-Kutta methods
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Performance safety enforcement in strongly connected timed event graphs
- Copositive optimization -- recent developments and applications
- Global optimization of nonconvex problems with convex-transformable intermediates
- Optimising lot sizing and order scheduling with non-linear production rates
- Node selection strategies in interval branch and bound algorithms
- A global continuation algorithm for solving binary quadratic programming problems
- Reformulations in Mathematical Programming: Definitions and Systematics
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems
- Distance geometry and data science
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
- A polyhedral branch-and-cut approach to global optimization
- MIP relaxations in factorable programming
- Mixed Monotonic Programming for Fast Global Optimization
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Perspective reformulation and applications
- Models and solution techniques for production planning problems with increasing byproducts
- Rigorous filtering using linear relaxations
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- Global solution of non-convex quadratically constrained quadratic programs
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Sufficient pruning conditions for MINLP in gas network design
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- Extending the QCR method to general mixed-integer programs
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- On the optimal design of water distribution networks: a practical MINLP approach
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- Disjunctive Cuts for Nonconvex MINLP
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Extended formulations for convex envelopes
- A reliable affine relaxation method for global optimization
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- Towards global parameter estimation exploiting reduced data sets
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A recipe for finding good solutions to MINLPs
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- A framework for globally optimizing mixed-integer signomial programs
- Efficient interval partitioning for constrained global optimization
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- On the Composition of Convex Envelopes for Quadrilinear Terms
- Optimization of a complex flexible multibody systems with composite materials
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
This page was built for publication: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881050)
