The following pages link to GlobSol (Q18804):
Displaying 37 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- On smooth reformulations and direct non-smooth computations for minimax problems (Q386469) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- The extrapolated interval global optimization algorithm (Q540704) (← links)
- Efficient and accurate computation of upper bounds of approximation errors (Q633637) (← links)
- Efficient task scheduling in the parallel result-verifying solution of nonlinear systems (Q811943) (← links)
- Efficient interval partitioning for constrained global optimization (Q956597) (← links)
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions (Q980524) (← links)
- A framework for existence tests based on the topological degree and homotopy (Q1006842) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (Q1713205) (← links)
- Blending set and interval arithmetic for maximal reliability (Q1774157) (← links)
- A comparison of complete global optimization solvers (Q1780958) (← links)
- Who invented the reverse mode of differentiation? (Q1946037) (← links)
- On rigorous upper bounds to a global optimum (Q2250091) (← links)
- Interval methods and contractor-based branch-and-bound procedures for verified parameter identification of quasi-linear cooperative system models (Q2332778) (← links)
- Some observations on exclusion regions in branch and bound algorithms (Q2349518) (← links)
- A general framework for convexity analysis in deterministic global optimization (Q2392103) (← links)
- A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
- Hardware support for interval arithmetic (Q2494415) (← links)
- Validated constraints solving --- practicalities, pitfalls, and new developments (Q2568645) (← links)
- Using Expression Graphs in Optimization Algorithms (Q2897299) (← links)
- Erratum: Validated Linear Relaxations and Preprocessing: Some Experiments (Q3004991) (← links)
- Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations (Q3008248) (← links)
- Interval computations, rigour and non-rigour in deterministic continuous global optimization (Q3093044) (← links)
- GlobSol user guide (Q3396392) (← links)
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization (Q3423591) (← links)
- (Q4949341) (← links)
- From the Product Example to PDE Adjoints, Algorithmic Differentiation and Its Application (Invited Talk) (Q5168465) (← links)
- Complete search in continuous global optimization and constraint satisfaction (Q5292941) (← links)
- Numerical Software with Result Verification (Q5308343) (← links)
- Numerical Software with Result Verification (Q5308354) (← links)
- Interval Methods for Solving Nonlinear Constraint Satisfaction, Optimization and Similar Problems (Q5379671) (← links)
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces (Q5746707) (← links)
- Standardized Interval Arithmetic and Interval Arithmetic Used in Libraries (Q5747901) (← links)
- Global optimization (Q5896995) (← links)
