A polyhedral branch-and-cut approach to global optimization
From MaRDI portal
(Redirected from Publication:1780949)
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
Cites work
- scientific article; zbMATH DE number 1456803 (Why is no real title available?)
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A nonlinear programming technique for the optimization of continuous processing systems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Approximation of smooth convex bodies by random circumscribed polytopes
- Asymptotic estimates for best and stepwise approximation of convex bodies II
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex extensions and envelopes of lower semi-continuous functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Convexity and concavity detection in computational graphs: tree walks for convexity assessment
- Discovering the Characteristics of Mathematical Programs via Sampling
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Semidefinite relaxations of fractional programs via novel convexification techniques
- The Cutting-Plane Method for Solving Convex Programs
- The convergence rate of the sandwich algorithm for approximating convex functions
Cited in
(only showing first 100 items - show all)- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- 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
- Global optimization in stabilizing controller design
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Multi-fidelity algorithms for the horizontal alignment problem in road design
- 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
- A bridging method for global optimization
- SUSPECT: MINLP special structure detector for Pyomo
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
- Reachability analysis and deterministic global optimization of DAE models
- Approximated perspective relaxations: a project and lift approach
- Minimizing the sum of many rational functions
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
- Polyhedral approximation in mixed-integer convex optimization
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- QPLIB: a library of quadratic programming instances
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- An exact semidefinite programming approach for the max-mean dispersion problem
- Relaxations of factorable functions with convex-transformable intermediates
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- A primal heuristic for optimizing the topology of gas networks based on dual information
- A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem
- Alternative branching rules for some nonconvex problems
- Validation of nominations in gas network optimization: models, methods, and solutions
- A polynomial optimization approach to constant rebalanced portfolio selection
- An Algorithm for Maximizing a Convex Function Based on Its Minimum
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation
- Optimal deterministic algorithm generation
- A general system for heuristic minimization of convex functions over non-convex sets
- Computing feasible points for binary MINLPs with MPECs
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- Optimal control of water distribution networks without storage
- Tighter McCormick relaxations through subgradient propagation
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- Designing an optimal contract mechanism in a cellulosic biofuel enterprise
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Global solutions to a class of CEC benchmark constrained optimization problems
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Tax-aware dynamic asset allocation
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- Global optimization of semi-infinite programs via restriction of the right-hand side
- 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
- Optimized ellipse packings in regular polygons
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- A Recursively Recurrent Neural Network (R2N2) Architecture for Learning Iterative Algorithms
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- Conflict Analysis for MINLP
- A review of recent advances in global optimization
- Optimized packing multidimensional hyperspheres: a unified approach
- A data-driven matching algorithm for ride pooling problem
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
- Proportional packing of circles in a circular container
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application
- 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
- Medium-term power planning in electricity markets with pool and bilateral contracts
- Global optimization of nonconvex problems with multilinear intermediates
- Packing congruent hyperspheres into a hypersphere
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- On tightness and anchoring of McCormick and other relaxations
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Convex and concave relaxations of implicit functions
- Reformulations for utilizing separability when solving convex MINLP problems
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
- High-Performance Prototyping of Decomposition Methods in GAMS
- Solving highly detailed gas transport MINLPs: block separability and penalty alternating direction methods
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- Dual adaptive model predictive control
- 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
- Sufficient matrices: properties, generating and testing
- A vector linear programming approach for certain global optimization problems
- Global optimization of nonconvex problems with convex-transformable intermediates
- Deterministic global optimization with Gaussian processes embedded
- Node selection strategies in interval branch and bound algorithms
- Oops! I cannot do it again: testing for recursive feasibility in MPC
- The exact solution of multiparametric quadratically constrained quadratic programming problems
- 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
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
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)
