Preface
type: Item
instance of: scholarly article
title: Preface
zbMATH Open document ID: 1477.00034
published in: Mathematical Programming. Series A. Series B
publication date: 2021-08-11T00:00:00Z
Mathematics Subject Classification ID: 00B15
Mathematics Subject Classification ID: 90-06
zbMATH DE Number: 7380864
describes a project that uses: BARON
MaRDI profile type: MaRDI publication profile
full work available at URL: s10107-021-01687-2
OpenAlex ID: W4243264652
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: A duality theorem and an algorithm for (mixed-) integer nonlinear programming
cites work: Q3241581
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Developments in global optimization. Proceedings of the 3rd workshop, Szeged, Hungary, December 10--14, 1995
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
cites work: Q4331736
cites work: Generalized Benders decomposition
cites work: Global optimization in engineering design
cites work: Q5591246
cites work: Handbook of global optimization
cites work: Q5731301
cites work: There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Global optimization. From theory to implementation.
cites work: Finding all solutions of nonlinearly constrained systems of equations
cites work: Q3992465
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: On shooting methods for boundary value problems
cites work: Handbook of global optimization. Vol. 2
cites work: The maximum principle, Bellman's equation, and Carathéodory's work
cites work: Q3285814
cites work: A branch-and-reduce approach to global optimization
cites work: Q4165836
cites work: A finite algorithm for global minimization of separable concave programs
cites work: Q3347174
cites work: Different transformations for solving non-convex trim-loss problems by MINLP
cites work: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
cites work: Theory of chattering control with applications to astronautics, robotics, economics, and engineering
DOI: 10.1007/S10107-021-01687-2
description: scientific article; zbMATH DE number 7380864