INTOPT_90
From MaRDI portal
INTOPT 90
Cited in
(only showing first 100 items - show all)- A framework for existence tests based on the topological degree and homotopy
- A new method for solving interval and fuzzy equations: linear case
- First-order design of geodetic networks using the simulated annealing method
- Slope enclosures for functions given by two or more branches
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems
- Fast construction of constant bound functions for sparse polynomials
- An efficient algorithm for range computation of polynomials using the Bernstein form
- 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
- Optimal enclosure of quadratic interval functions
- ACETAF
- BARON
- CHABIS
- On proving existence of feasible points in equality constrained optimization problems
- C-XSC
- C-XSC 2.0
- A nonsmooth global optimization technique using slopes: The one-dimensional case
- Global Optimization Toolbox For Maple
- GLOPT
- INTBIS
- INTLIB
- intpakX
- taco
- MPFI
- PROFIL/BIAS
- Projective Noether
- RFSFNS
- Statool
- UniCalc
- ZEBEC
- An interval entropy penalty method for nonlinear global optimization
- When is the product of intervals also an interval?
- Worst-case simulation of discrete linear time-invariant interval dynamic systems
- Numerical solution for bounding feasible point sets
- Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints
- Heuristic rejection in interval global optimization
- Rational functions with prescribed global and local minimizers
- New interval analysis support functions using gradient information in a global minimization algorithm
- On first zero crossing points.
- AMIGO
- TRIOPT
- SOCP
- The hull of preconditioned interval linear equations
- Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- Recent developments and trends in global optimization
- Interval mathematics, algebraic equations and optimization
- Using interval analysis for solving planar single-facility location problems: New discarding tests
- Efficient interval linear equality solving in constraint logic programming
- A realistic (non-associative) logic and a possible explanations of \(7\pm 2\) law
- Accelerating filtering techniques for numeric CSPs
- On existence and uniqueness verification for non-smooth functions
- Numerical validation of solutions of complementarity problems: the nonlinear case
- INTLAB
- ICOS
- Always convergent methods for nonlinear equations of several variables
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- RealPaver
- Certificates of infeasibility via nonsmooth optimization
- A certified branch \& bound approach for reliability-based optimization problems
- CFSQP
- NDA
- INTERVAL_ARITHMETIC
- COCONUT
- Efficient importance sampling in low dimensions using affine arithmetic
- Domain reduction techniques for global NLP and MINLP optimization
- TADIFF
- MIPTS
- Solution method for a boundary value problem with fuzzy forcing function
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- Probabilities, intervals, what next? Optimization problems related to extension of interval computations to situations with partial information about probabilities
- Advances in interval methods for deterministic global optimization in chemical engineering
- Some global optimization problems on Stiefel manifolds
- gaol
- A rigorous global filtering algorithm for quadratic constraints
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A comparison of complete global optimization solvers
- Parametric functional representation of interval number with arithmetic operations
- PNM
- Numerical validation of solutions of linear complementarity problems
- Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
- Interval methods for accelerated global search in the microsoft excel solver
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
- A hybrid global optimization method: The multi-dimensional case
- Slope intervals, generalized gradients, semigradients, slant derivatives, and csets
- Integral approximation of rays and verification of feasibility
- Clouds, fuzzy sets, and probability intervals
- Box valued functions in solving systems of equations and inequalities
- alphaBB
- A new multisection technique in interval methods for global optimization
- Passive robust fault detection using fuzzy parity equations
- On bounding zeros of analytic functions
- filib++
- A hybrid global optimization method: The one-dimensional case
- Creating and handling box valued functions used in numerical methods
- Search heuristics for box decomposition methods
- A new technique in systems analysis under interval uncertainty and ambiguity
- Symbolic preconditioning with Taylor models: Some examples
- libMC
- Computing validated solutions of implicit differential equations
This page was built for software: INTOPT_90