scientific article; zbMATH DE number 3936378
From MaRDI portal
Publication:3707258
Cited in
(only showing first 100 items - show all)- Bounding the zeros of an interval equation
- An efficient algorithm for range computation of polynomials using the Bernstein form
- Including iterations for the Lambda-matrix eigenproblem
- On higher order centered forms
- A low complexity explicit rational centered form
- Low complexity k-dimensional centered forms
- Fast iterative algorithms based on optimized explicit time stepping
- Interval Taylor forms
- On a monotone Newton-like method
- Inclusion isotonicity of circular complex centered forms
- Optimal centered forms
- Low complexity k-dimensional Taylor forms
- The number of centered forms for a polynomial
- An interval method for bounding level sets of parameter estimation problems
- Optimal choice of linear interval extension
- Disk Bézier curves
- Interval Newton/generalized bisection when there are singularities near roots
- LP-form inclusion functions for global optimization
- An analytical approach to global optimization
- A new method of evaluating compact geometric bounds for use in subdivision algorithms
- What can interval analysis do for global optimization?
- Circular centered forms for rational functions in several complex variables
- Bounds for eigenvalues of parameter-dependent matrices
- Constraint reasoning based on interval arithmetic: The tolerance propagation approach
- Forms for meromorphic functions
- Extended projection methods for monotone variational inequalities
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
- Experiments using interval analysis for solving a circuit design problem
- Test for intersection between circle and rectangle
- Cord-slope form of Taylor's expansion in univariate global optimization
- The cluster problem in multivariate global optimization
- Finding maximum likelihood estimators for the three-parameter Weibull distribution
- Finding the likely behaviors of static continuous nonlinear systems
- Guaranteed analysis and optimisation of parametric systems with application to their stability degree
- Formulation assistance for global optimization problems
- A sufficient condition for non-overestimation in interval arithmetic
- Lower bound functions for polynomials
- Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems
- Interval analysis: Theory and applications
- A lower bound for range enclosure in interval arithmetic
- Accelerating filtering techniques for numeric CSPs
- Comparison of interval methods for plotting algebraic curves
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Chebyshev model arithmetic for factorable functions
- Function approximation on non-Euclidean spaces
- Global solution of semi-infinite programs
- Nonlinear equations and optimization
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- The globally convexized filled functions for global optimization
- Rational circular complex centered forms
- Bernstein form is inclusion monotone
- A numerical method for accurately approximating multivariate normal probabilities
- Methods for bounding the range of a polynomial
- Interpolation that leads to the narrowest intervals and its application to expert systems and intelligent control
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- Constructing large feasible suboptimal intervals for constrained nonlinear optimization
- An interval iteration for multiple roots of transcendental equations
- A numerically rigorous proof of curve veering in an eigenvalue problem for differential equations
- Interval approximation of higher order to the ranges of functions
- Interval approach challenges Monte Carlo simulation
- Optimal interval enclosures for fractionally-linear functions, and their application to intelligent control
- A continuous location model for siting a non-noxious undesirable facility within a geographical region
- Tighter McCormick relaxations through subgradient propagation
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
- On the complexity of the Plantinga-Vegter algorithm
- The complexity of subdivision for diameter-distance tests
- On tightness and anchoring of McCormick and other relaxations
- Global optimization to prescribed accuracy
- Parameter range reduction from partial data in systems of differential algebraic equations
- A family of centered forms for rational functions
- On interval branch-and-bound for additively separable functions with common variables
- Use of an interval global optimization tool for exploring feasibility of batch extractive distillation
- Non-causal models in long term planning via set contractive optimal control methods
- Computing the pessimism of inclusion functions
- New interval methods for constrained global optimization
- Sharpening interval computations
- Modified affine arithmetic in tensor form for trivariate polynomial evaluation and algebraic surface plotting
- Parameter range reduction in ordinary differential equation models
- A circular splitting search algorithm for systems of complex equations
- Optimal centers in branch-and-prune algorithms for univariate global optimization
- A new inclusion function for optimization: kite -- the one-dimensional case
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Solving minimax problems by interval methods
- Global attractivity of the zero solution for Wright's equation
- scientific article; zbMATH DE number 4141382 (Why is no real title available?)
- Convergence analysis of Taylor models and McCormick-Taylor models
- Inclusion functions and global optimization
- Global minimization of univariate functions by sequential polynomial approximation
- scientific article; zbMATH DE number 46720 (Why is no real title available?)
- Estimates for fredholm integral equations
- Interval robust multi-objective algorithm
- A new interval method for locating the boundary of level sets
- Test for intersection between box and tetrahedron
- Computational complexity of iterated maps on the interval
- Automatic test case generation using interval arithmetic
- A branch-and-prune method for global optimization
- Traditional Parameter Estimation Versus Estimation of Guaranteed Parameter Sets
- Reverse propagation of McCormick relaxations
- Convergence analysis of multivariate McCormick relaxations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707258)