Pages that link to "Item:Q1353367"
From MaRDI portal
The following pages link to Rigorous global search: continuous problems (Q1353367):
Displaying 50 items.
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints (Q1935885) (← links)
- About tracing problems in dynamic geometry (Q1943666) (← links)
- A deterministic approach to global box-constrained optimization (Q1947630) (← links)
- Template generation for continuous transfer functions using interval analysis (Q1961201) (← links)
- On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method (Q2018467) (← links)
- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems (Q2022241) (← links)
- An interval branch and bound method for global robust optimization (Q2046260) (← links)
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
- Sums and products of intervals in ordered groups and fields (Q2062498) (← links)
- Numerical certification of Pareto optimality for biobjective nonlinear problems (Q2154462) (← links)
- Piecewise linear bounding functions in univariate global optimization (Q2156897) (← links)
- A stochastic optimization algorithm for analyzing planar central and balanced configurations in the \(n\)-body problem (Q2159142) (← links)
- New parameterized solution with application to bounding secondary variables in FE models of structures (Q2177907) (← links)
- A new neural network model for solving random interval linear programming problems (Q2181038) (← links)
- On rigorous upper bounds to a global optimum (Q2250091) (← links)
- Exclusion regions for optimization problems (Q2250096) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- Method for localizing the zeros of analytic functions based on the Krawczyk operator (Q2320247) (← links)
- Bipolar fuzzy linear system of equations (Q2322458) (← links)
- Interval oriented entropy based multi-item solid transportation problem with budget and breakability (Q2355165) (← links)
- Interval unions (Q2359762) (← links)
- On-line algorithms for computing mean and variance of interval data, and their use in intelligent systems (Q2372221) (← links)
- Computing slope enclosures by exploiting a unique point of inflection (Q2378918) (← links)
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints (Q2383678) (← links)
- On interval branch-and-bound for additively separable functions with common variables (Q2392130) (← links)
- Deterministic global optimization in ab-initio quantum chemistry (Q2392771) (← links)
- Interval linear systems as a necessary step in fuzzy linear systems (Q2397883) (← links)
- Using interval unions to solve linear systems of equations with uncertainties (Q2411656) (← links)
- Rigorous packing of unit squares into a circle (Q2416578) (← links)
- Balanced random interval arithmetic in market model estimation (Q2433495) (← links)
- The 1-center problem in the plane with independent random weights (Q2456633) (← links)
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm (Q2460123) (← links)
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems (Q2460136) (← links)
- Computing the pessimism of inclusion functions (Q2481139) (← links)
- A verified inexact implicit Runge-Kutta method for nonsmooth ODEs (Q2483052) (← links)
- Exact bounds on finite populations of interval data (Q2484079) (← links)
- New interval methods for constrained global optimization (Q2490338) (← links)
- Fast algorithm for computing the upper endpoint of sample variance for interval data: Case of sufficiently accurate measurements (Q2490454) (← links)
- Complex interval arithmetic using polar form (Q2490456) (← links)
- Fuzzy linear systems of the form \(A_{1}x+b_{1}=A_{2}x+b_{2}\) (Q2492344) (← links)
- A multidimensional interval Newton method (Q2503168) (← links)
- Computational experience with rigorous error bounds for the Netlib linear programming library (Q2503174) (← links)
- Validated constraints solving --- practicalities, pitfalls, and new developments (Q2568645) (← links)
- An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems (Q2568646) (← links)
- Optimal centers in branch-and-prune algorithms for univariate global optimization (Q2572338) (← links)
- Motivations for an arbitrary precision interval arithmetic and the MPFI library (Q2572919) (← links)
- Second-order bounds for linear recurrences with negative coefficients (Q2573478) (← links)
- A new inclusion function for optimization: kite -- the one-dimensional case (Q2574104) (← links)
- On the computation of invariant sets for constrained nonlinear systems: an interval arithmetic approach (Q2576114) (← links)
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
