Convergent upper bounds in global minimization with nonlinear equality constraints
type: Item
instance of: scholarly article
title: Convergent upper bounds in global minimization with nonlinear equality constraints
zbMATH Open document ID: 1465.90070
author: Christian Füllner
author: Peter Kirst
author: Oliver Stein
published in: Mathematical Programming. Series A. Series B
publication date: 2021-04-23T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7337520
zbMATH Keywords: branch-and-bound
zbMATH Keywords: convergent upper bounds
zbMATH Keywords: feasibility verification
zbMATH Keywords: theorem of Miranda
describes a project that uses: BARON
describes a project that uses: INTLAB
describes a project that uses: LINDO
describes a project that uses: LINDOGlobal
describes a project that uses: ANTIGONE
MaRDI profile type: Publication
full work available at URL: s10107-020-01493-2
OpenAlex ID: W3015241550
cites work: Rigorous convex underestimators for general twice-differentiable problems
cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems
cites work: Optimal centered forms
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: Rigorous verification of feasibility
cites work: Dual bounding procedures lead to convergent branch-and-bound algorithms
cites work: A class of problems where dual bounds beat underestimation bounds
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: Deterministic global optimization in nonlinear optimal control problems
cites work: A review of recent advances in global optimization
cites work: Using Piecewise Linear Functions for Solving MINLPs
cites work: Q4889854
cites work: Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
cites work: On the complexity of equalizing inequalities
cites work: On proving existence of feasible points in equality constrained optimization problems
cites work: On rigorous upper bounds to a global optimum
cites work: Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
cites work: Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
cites work: The Poincare-Miranda Theorem
cites work: Global optimization. From theory to implementation.
cites work: The global solver in the LINDO API
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Piecewise-linear approximations of multidimensional functions
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: Global optimization of semi-infinite programs via restriction of the right-hand side
cites work: Global optimization of generalized semi-infinite programs via restriction of the right hand side
cites work: Interval Methods for Systems of Equations
cites work: Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
cites work: Continuous piecewise linear delta-approximations for bivariate and multivariate functions
cites work: Q4949347
cites work: A branch-and-reduce approach to global optimization
cites work: BARON: A general purpose global optimization software package
cites work: Global Optimization and Constraint Satisfaction
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: A Short Proof and a Generalization of Miranda's Existence Theorem
cites work: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
DOI: 10.1007/S10107-020-01493-2
description: scientific article; zbMATH DE number 7337520