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)
- Global optimization in stabilizing controller design
- A bridging method for global optimization
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- SUSPECT: MINLP special structure detector for Pyomo
- QPLIB: a library of quadratic programming instances
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Approximated perspective relaxations: a project and lift approach
- Minimizing the sum of many rational functions
- DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Alternative branching rules for some nonconvex problems
- Validation of nominations in gas network optimization: models, methods, and solutions
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Global solutions to a class of CEC benchmark constrained optimization problems
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- A review of recent advances in global optimization
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Packing congruent hyperspheres into a hypersphere
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Convex Programming Methods for Global Optimization
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Dynamic coupling of photoacclimation and photoinhibition in a model of microalgae growth
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- The supporting hyperplane optimization toolkit for convex MINLP
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- Mathematical programming techniques in water network optimization
- A MILP formulation for generalized geometric programming using piecewise-linear approximations
- National-strategic investment in European power transmission capacity
- Validated Linear Relaxations and Preprocessing: Some Experiments
- Bound constrained interval global optimization in the COCONUT environment
- Extended formulations for convex envelopes
- Upper bounding in inner regions for global optimization under inequality constraints
- Robust bilateral trade with discrete types
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A model for clustering data from heterogeneous dissimilarities
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- A framework for globally optimizing mixed-integer signomial programs
- Reduced RLT representations for nonconvex polynomial programming problems
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
- Conic mixed-integer rounding cuts
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- Global optimization of general non-convex problems with intermediate bilinear substructures
- GLOMIQO: global mixed-integer quadratic optimizer
- Convergence rate of McCormick relaxations
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
- A distributionally ambiguous two-stage stochastic approach for investment in renewable generation
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A hybrid LP/NLP paradigm for global optimization relaxations
- Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction
- Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- A review of deterministic optimization methods in engineering and management
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Construction of convex relaxations using automated code generation techniques
- On valid inequalities for mixed integer \(p\)-order cone programming
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
- A choice-based optimization approach for contracting in supply chains
- Decomposition strategy for the stochastic pooling problem
- Simultaneous location of trauma centers and helicopters for emergency medical service planning
- Some results on the strength of relaxations of multilinear functions
- On convex relaxations of quadrilinear terms
- On convex envelopes for bivariate functions over polytopes
- A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Extended formulations in mixed integer conic quadratic programming
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Multivariate McCormick relaxations
- Fast algorithm for the cutting angle method of global optimization
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
- 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
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)
