Optimal centered forms
From MaRDI portal
Die zentrische Form \(F(X,c):=f(c)+L(X)(X-c)\) einer reellen Funktion \(f: D\subseteq {\mathbb{R}}^ n\to {\mathbb{R}}\) erlaubt die Einschließung der Wertemenge \(f(X):=\{f(x)| \quad x\in X\}.\) \(X\in I({\mathbb{R}}^ n)\) bezeichnet einen Intervallvektor, L: I(D)\(\times D\to I({\mathbb{R}}^ n)\) eine Intervall-Lipschitzfunktion und im allgemeinen wird \(c=mid X\) gewählt. Durch geeignete Wahl zweier Argumente \(c^-\) und \(c^+\in D\) gelingt es dem Verf., \(\inf F(x,c^-)\) und \(\sup F(x,c^+)\) optimal zu bestimmen, d.h., für alle \(c\in X\) gilt \([\inf F(X,c^-),\sup F(X,c^+)]\subseteq F(X,c).\)
Recommendations
- scientific article; zbMATH DE number 3876479
- Optimal bicentered form
- scientific article; zbMATH DE number 3876478
- scientific article; zbMATH DE number 2219860
- On higher order centered forms
- Low complexity k-dimensional centered forms
- Centered forms and interval operators
- An optimal extension of the centerpoint theorem
- Central fields of optimal trajectories
- Formes normales et problème du centre symétrique
Cites work
- Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- Interval Slopes for Rational Functions and Associated Centered Forms
- Mean value forms in interval analysis
- Quadratic convergence in interval arithmetic, part I
Cited in
(32)- Interval expansion method for nonlinear equation in several variables
- A class of componentwise Krawczyk-Moore type iteration methods
- Robust analysis and design of control systems using interval arithmetic
- Global optimization of disjunctive programs
- Global solution of semi-infinite programs
- Bernstein form is inclusion monotone
- Interval methods for global optimization
- Convergent upper bounds in global minimization with nonlinear equality constraints
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- On interval branch-and-bound for additively separable functions with common variables
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
- Continuous minimax optimization using modal intervals
- New results on verified global optimization
- Optimal centers in branch-and-prune algorithms for univariate global optimization
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context
- A new inclusion function for optimization: kite -- the one-dimensional case
- Solving minimax problems by interval methods
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- A branch-and-prune method for global optimization
- Bound constrained interval global optimization in the COCONUT environment
- scientific article; zbMATH DE number 2219860 (Why is no real title available?)
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
- Robot workspace approximation with modified bicentered Krawczyk method
- Bicentered interval Newton operator for Robot's workspace approximation
- A branch-and-bound algorithm for nonconvex Nash equilibrium problems
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Theoretical rate of convergence for interval inclusion functions
- On the use of restriction of the right-hand side in spatial branch-and-bound algorithms to ensure termination
- A second-order pruning step for verified global optimization
- Empirical convergence speed of inclusion functions for facility location problems
- Comparison between Baumann and admissible simplex forms in interval analysis
This page was built for publication: Optimal centered forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1100850)
