A polyhedral branch-and-cut approach to global optimization
From MaRDI portal
Publication:1780949
DOI10.1007/S10107-005-0581-8zbMATH Open1099.90047OpenAlexW2004407575MaRDI QIDQ1780949FDOQ1780949
Authors: Mohit Tawarmalani, Nikolaos V. Sahinidis 
Publication date: 14 June 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0581-8
Recommendations
- A hybrid LP/NLP paradigm for global optimization relaxations
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Global optimization of nonconvex problems with multilinear intermediates
- Convex Programming Methods for Global Optimization
- Global optimization of nonconvex problems with convex-transformable intermediates
Outer approximationConvexificationMixed-integer nonlinear programmingConvexity identificationFactorable programming
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Convex extensions and envelopes of lower semi-continuous functions
- The Cutting-Plane Method for Solving Convex Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Semidefinite relaxations of fractional programs via novel convexification techniques
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A nonlinear programming technique for the optimization of continuous processing systems
- The convergence rate of the sandwich algorithm for approximating convex functions
- Title not available (Why is that?)
- Asymptotic estimates for best and stepwise approximation of convex bodies II
- Approximation of smooth convex bodies by random circumscribed polytopes
- Convexity and concavity detection in computational graphs: tree walks for convexity assessment
- Discovering the Characteristics of Mathematical Programs via Sampling
Cited In (only showing first 100 items - show all)
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- An exact semidefinite programming approach for the max-mean dispersion problem
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- A polynomial optimization approach to constant rebalanced portfolio selection
- Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Global optimization of semi-infinite programs via restriction of the right-hand side
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Optimized packing multidimensional hyperspheres: a unified approach
- Global optimization of nonconvex problems with multilinear intermediates
- Convex and concave relaxations of implicit functions
- Solving highly detailed gas transport MINLPs: block separability and penalty alternating direction methods
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Reformulations for utilizing separability when solving convex MINLP problems
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
- Node selection strategies in interval branch and bound algorithms
- A global MINLP approach to symbolic regression
- Oops! I cannot do it again: testing for recursive feasibility in MPC
- Title not available (Why is that?)
- All or nothing at all
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- Target-oriented branch and bound method for global optimization
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Template polyhedra and bilinear optimization
- Improved convex and concave relaxations of composite bilinear forms
- Sufficient pruning conditions for MINLP in gas network design
- A new method for strong-weak linear bilevel programming problem
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
- An improved test set approach to nonlinear integer problems with applications to engineering design
- On global optimization with indefinite quadratics
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control
- Extended formulations in mixed-integer convex programming
- A deterministic algorithm for global optimization
- A modified DIRECT algorithm with bilevel partition
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- On linear programming relaxations for solving polynomial programming problems
- Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization
- A cost minimization heuristic for the pooling problem
- Reverse propagation of McCormick relaxations
- Error bounds for monomial convexification in polynomial optimization
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Deterministic global optimization with artificial neural networks embedded
- Explicit hybrid model-predictive control: the exact solution
- Strong SOCP relaxations for the optimal power flow problem
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- A deterministic approach to global box-constrained optimization
- On the product knapsack problem
- Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
- An approach to the subproblem of the cutting angle method of global optimization
- Network expansion to mitigate market power
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- Three enhancements for optimization-based bound tightening
- Convergence analysis of multivariate McCormick relaxations
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Non-convex nested Benders decomposition
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Reachability analysis and deterministic global optimization of DAE models
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- An Algorithm for Maximizing a Convex Function Based on Its Minimum
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- Designing an optimal contract mechanism in a cellulosic biofuel enterprise
- Valid inequalities for the topology optimization problem in gas network design
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Optimized ellipse packings in regular polygons
- Conflict Analysis for MINLP
- A data-driven matching algorithm for ride pooling problem
- Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- On tightness and anchoring of McCormick and other relaxations
- Bi-objective design-for-control of water distribution networks with global bounds
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- Deterministic global optimization with Gaussian processes embedded
- Piecewise polyhedral formulations for a multilinear term
- On the numerical solution of the quadratic eigenvalue complementarity problem
- Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques
- Optimization and validation of pumping system design and operation for water supply in high-rise buildings
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Discriminant analysis of distributional data via fractional programming
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks
- Title not available (Why is that?)
- Nonconvex constrained optimization by a filtering branch and bound
- Solving generalized polynomial problem by using new affine relaxed technique
- A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
Uses Software
This page was built for publication: A polyhedral branch-and-cut approach to global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1780949)
