Optimal centered forms

From MaRDI portal
Publication:1100850

DOI10.1007/BF01934696zbMath0641.65043MaRDI QIDQ1100850

Eckart Baumann

Publication date: 1988

Published in: BIT (Search for Journal in Brave)




Related Items (28)

A second-order pruning step for verified global optimizationBernstein form is inclusion monotoneSolving minimax problems by interval methodsOn interval branch-and-bound for additively separable functions with common variablesEmpirical convergence speed of inclusion functions for facility location problemsRobust analysis and design of control systems using interval arithmeticInterval methods for global optimizationA class of componentwise Krawczyk-Moore type iteration methodsA Branch-and-Prune Method for Global OptimizationGlobal optimization of disjunctive programsRobot workspace approximation with modified bicentered Krawczyk methodBound constrained interval global optimization in the COCONUT environmentMulti-dimensional pruning from the Baumann point in an interval global optimization algorithmGlobal optimization of generalized semi-infinite programs using disjunctive programmingContinuous minimax optimization using modal intervalsTheoretical rate of convergence for interval inclusion functionsConvergent upper bounds in global minimization with nonlinear equality constraintsGlobal solution of semi-infinite programsComparison between Baumann and admissible simplex forms in interval analysisAn extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matricesOn new methods to construct lower bounds in simplicial branch and bound based on interval arithmeticConvex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraintInterval expansion method for nonlinear equation in several variablesNew results on verified global optimizationOptimal centers in branch-and-prune algorithms for univariate global optimizationEmpirical investigation of the convergence speed of inclusion functions in a global otimization contextA new inclusion function for optimization: kite -- the one-dimensional caseDeterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints



Cites Work


This page was built for publication: Optimal centered forms