Convergence-order analysis of branch-and-bound algorithms for constrained problems
type: Item
instance of: scholarly article
title: Convergence-order analysis of branch-and-bound algorithms for constrained problems
zbMATH Open document ID: 1397.49042
author: Rohit Kannan
author: Paul I. Barton
published in: Journal of Global Optimization
publication date: 2018-08-29T00:00:00Z
full work available at URL: http://hdl.handle.net/1721.1/117047
Mathematics Subject Classification ID: 49M20
Mathematics Subject Classification ID: 49M29
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6928827
zbMATH Keywords: global optimization
zbMATH Keywords: constrained optimization
zbMATH Keywords: convergence order
zbMATH Keywords: convex relaxation
zbMATH Keywords: Lagrangian dual
zbMATH Keywords: branch-and-bound
zbMATH Keywords: lower bounding scheme
zbMATH Keywords: reduced-space
describes a project that uses: CVX
describes a project that uses: ANTIGONE
MaRDI profile type: Publication
OpenAlex ID: W2620905467
cites work: Rigorous convex underestimators for general twice-differentiable problems
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: Global minimization by reducing the duality gap
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Convergence rate of McCormick relaxations
cites work: Convergence analysis of Taylor models and McCormick-Taylor models
cites work: The cluster problem in multivariate global optimization
cites work: Dual bounding procedures lead to convergent branch-and-bound algorithms
cites work: Lagrange duality and partitioning techniques in nonconvex global optimization
cites work: A reduced space branch and bound algorithm for global optimization.
cites work: A review of recent advances in global optimization
cites work: Q4889854
cites work: The cluster problem in constrained global optimization
cites work: Q3707258
cites work: Differentiable McCormick relaxations
cites work: Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
cites work: Convex envelopes of monomials of odd degree
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: Introduction to Interval Analysis
cites work: Convergence analysis of multivariate McCormick relaxations
cites work: Convex Analysis
cites work: The convergence rate of the sandwich algorithm for approximating convex functions
cites work: Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
cites work: Principles of functional analysis.
cites work: The theoretical and empirical rate of convergence for geometric branch-and-bound methods
cites work: Theoretical rate of convergence for interval inclusion functions
cites work: Convex and concave relaxations of implicit functions
cites work: Convex extensions and envelopes of lower semi-continuous functions
cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Multivariate McCormick relaxations
cites work: The cluster problem revisited
DOI: 10.1007/S10898-017-0532-Y
description: scientific article; zbMATH DE number 6928827