A hybrid LP/NLP paradigm for global optimization relaxations
From MaRDI portal
Publication:1621693
DOI10.1007/s12532-018-0138-5zbMath1400.90227OpenAlexW2804302623WikidataQ114859100 ScholiaQ114859100MaRDI QIDQ1621693
Aida Khajavirad, Nikolaos V. Sahinidis
Publication date: 9 November 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-018-0138-5
global optimizationbranch-and-reducenonlinear relaxationsautomatic convexity detectionpolyhedral relaxations
Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (26)
EAGO.jl: easy advanced global optimization in Julia ⋮ Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems ⋮ Solving generalized polynomial problem by using new affine relaxed technique ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity ⋮ Optimality-based domain reduction for inequality-constrained NLP and MINLP problems ⋮ Efficient joint object matching via linear programming ⋮ Packing convex polygons in minimum-perimeter convex hulls ⋮ Branch-and-Model: a derivative-free global optimization algorithm ⋮ A potential practical algorithm for minimizing the sum of affine fractional functions ⋮ On the impact of running intersection inequalities for globally solving polynomial optimization problems ⋮ On the strength of recursive McCormick relaxations for binary polynomial optimization ⋮ Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization ⋮ Finding Symmetry Groups of Some Quadratic Programming Problems ⋮ An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver ⋮ Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs ⋮ Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON ⋮ A note on solving DiDi's driver-order matching problem ⋮ Global optimization of nonconvex problems with convex-transformable intermediates ⋮ \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems ⋮ The Running Intersection Relaxation of the Multilinear Polytope ⋮ Linearization of McCormick relaxations and hybridization with the auxiliary variable method ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems ⋮ Alternative regularizations for outer-approximation algorithms for convex MINLP ⋮ SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs ⋮ Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- DrAmpl: A meta solver for optimization problem analysis
- Constraint propagation on quadratic constraints
- An algorithmic framework for convex mixed integer nonlinear programs
- Generalized concavity
- Safe bounds in linear and mixed-integer linear programming
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- NP-hardness of deciding convexity of quartic polynomials and related problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Global optimization of nonconvex problems with multilinear intermediates
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment
- A Unifying Polyhedral Approximation Framework for Convex Optimization
- The Cutting-Plane Method for Solving Convex Programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- GlobSol user guide
- Efficient Calculation of Bounds on Spectra of Hessian Matrices
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Global optimization using special ordered sets
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Benchmarking optimization software with performance profiles.
- Analyzing mathematical programs using MProbe
This page was built for publication: A hybrid LP/NLP paradigm for global optimization relaxations
