INTOPT_90

swMATH4705MaRDI QIDQ16874FDOQ16874

Author name not available (Why is that?)

Described by source

• Rigorous global search: continuous problems

Cited In (only showing first 100 items - show all)

• A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials
• A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems
• Interval linear systems as a necessary step in fuzzy linear systems
• Application of modal intervals to the generation of error-bounded envelopes
• Existence Verification for Higher Degree Singular Zeros of Nonlinear Systems
• The hull of preconditioned interval linear equations
• Branch-and-Bound interval global optimization on shared memory multiprocessors
• Verifying topological indices for higher-order rank deficiencies
• The automatic computation of second-order slope tuples for some nonsmooth functions
• A second-order pruning step for verified global optimization
• Simulation of discrete linear time-invariant fuzzy dynamic systems
• Title not available (Why is that?)
• Cheap and tight bounds on the solution set of perturbed systems of nonlinear equations
• Slope enclosures for functions given by two or more branches
• Verified determination of singularities in chemical processes
• Numerical verification methods for spherical \(t\)-designs
• On verified numerical computations in convex programming
• Stability analysis and synthesis of multivariable fuzzy systems using interval arithmetic
• Second-order bounds for linear recurrences with negative coefficients
• A certified branch \& bound approach for reliability-based optimization problems
• Reliable modeling and optimization for chemical engineering applications: Interval analysis approach
• Two acceleration mechanisms in verified global optimization
• Comparison between Baumann and admissible simplex forms in interval analysis
• An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
• A comparison of the Moore and Miranda existence tests
• A branch-and-prune method for global optimization
• Bipolar fuzzy linear system of equations
• Solving interval constraints by linearization in computer-aided design
• Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions
• A framework for existence tests based on the topological degree and homotopy
• Global Optimization and Constraint Satisfaction
• Randomized algorithms in interval global optimization
• Verified integration of dynamics in the solar system.
• Using interval analysis for solving planar single-facility location problems: New discarding tests
• A global optimization algorithm using Lagrangian underestimates and the interval Newton method
• Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
• A new inclusion function for optimization: kite -- the one-dimensional case
• A deterministic algorithm for global optimization
• A method to find all the roots of the system of nonlinear algebraic equations based on the Krawczyk operator
• Fast algorithm for computing the upper endpoint of sample variance for interval data: Case of sufficiently accurate measurements
• Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints
• On interval branch-and-bound for additively separable functions with common variables
• A goal programming approach for solving the random interval linear programming problem
• On an efficient use of gradient information for accelerating interval global optimization algorithms
• Interval arithmetic and interval analysis: An introduction
• AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS
• Title not available (Why is that?)
• Title not available (Why is that?)
• A verified inexact implicit Runge-Kutta method for nonsmooth ODEs
• A new parallel method for verified global optimization
• Presentation of a highly tuned multithreaded interval solver for underdetermined and well-determined nonlinear systems. Empirical evaluation of innovations
• Solution method for a boundary value problem with fuzzy forcing function
• Quasiconvex relaxations based on interval arithmetic
• Locating and Computing Arbitrarily Distributed Zeros
• Existence verification for singular and nonsmooth zeros of real nonlinear systems
• Lipschitz continuity and the termination of interval methods for global optimization
• A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
• Beyond convex? global optimization is feasible only for convex objective functions: a theorem
• Title not available (Why is that?)
• Verified Solution Method for Population Epidemiology Models with Uncertainty
• Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions
• Title not available (Why is that?)
• INTLAB implementation of an interval global optimization algorithm
• The 1-center problem in the plane with independent random weights
• Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
• An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
• A new multi-section based technique for constrained optimization problems with interval-valued objective function
• Some variants of the controlled random search algorithm for global optimization
• Competitive facility location and design with reactions of competitors already in the market
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On constrained optimization by interval arithmetic and interval order relations
• Solution of linear differential equations with fuzzy boundary values
• Motivations for an arbitrary precision interval arithmetic and the MPFI library
• Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
• Interval additive generators of interval t-norms and interval t-conorms
• Certified error bounds for uncertain elliptic equations
• On the complexity of isolating real roots and computing with certainty the topological degree
• The use of interval arithmetic in solving a non-linear rational expectation based multiperiod output-inflation process model: the case of the IN/GB method
• New interval analysis support functions using gradient information in a global minimization algorithm
• Exclusion Regions for Systems of Equations
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Validated numerics. A short introduction to rigorous computations.
• Existence of Solutions to Systems of Underdetermined Equations and Spherical Designs
• Heuristic rejection in interval global optimization
• Numerical Software with Result Verification
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
• Title not available (Why is that?)
• New approaches to circle packing in a square. With program codes.
• Automatic computation of a linear interval enclosure
• Deterministic global optimization using interval constraint propagation techniques
• Existence Tests for Solutions of Nonlinear Equations Using Borsuk's Theorem
• Solving a huff-like competitive location and design model for profit maximization in the plane
• A Deterministic Global Optimization Algorithm for Design Problems
• A new technique in systems analysis under interval uncertainty and ambiguity
• Recent developments and trends in global optimization
• Upper bounding in inner regions for global optimization under inequality constraints
• New subinterval selection criteria for interval global optimization

This page was built for software: INTOPT_90