scientific article; zbMATH DE number 193463
convergenceglobal optimizationinterval arithmeticnonlinear optimizationnumerical examplestextbookunbounded domainsunconstrained optimization
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Interval and finite arithmetic (65G30) Numerical mathematical programming methods (65K05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Nonlinear programming (90C30)
The aim of this book is to give methods for solving global optimization problems. The methods are chosen by properties such as to be very stable and robust, universally applicable, fully reliable, etc.. In the concept interval arithmetic is used as a methodical means for keeping global information. The authors demonstrate that intervals are excellent tools for handling global optimization problems. The book is divided into five chapters. The first one gives an introduction to nonlinear optimization. In the next chapter one can find the necessary interval arithmetic background. Chapter 3 is concerned with algorithms for the unconstrained optimization problem and properties of them. Complete proofs of the convergence theorems are enclosed. In chapter 4 the developed theory and methods are applied to optimization problems over unbounded domains. In the last chapter constrained optimization is discussed. In all parts of the book numerical examples are given. This is a very interesting book in this area. Not only experienced readers but also beginners will benefit from it. The necessary previous knowledge is not too extensive, the book is written clearly and printed well. Therefore there is no difficulty in reading and understanding it.
- The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I: Correction methods
- Isoperimetric polygons of maximum width
- 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
- Global optimization algorithms for a CAD workstation
- Interval Newton/generalized bisection when there are singularities near roots
- LP-form inclusion functions for global optimization
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
- An analytical approach to global optimization
- What can interval analysis do for global optimization?
- Unconstrained and constrained global optimization of polynomial functions in one variable
- GBSSS: The generalized big square small square method for planar single- facility location
- Convergence qualification of adaptive partition algorithms in global optimization
- Set inversion via interval analysis for nonlinear bounded-error estimation
- A gentle introduction to Numerica
- Global one-dimensional optimization using smooth auxiliary functions
- On proving existence of feasible points in equality constrained optimization problems
- Parallel computing in nonconvex programming
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Experiments using interval analysis for solving a circuit design problem
- On the optimization concept of grey systems
- Characterization of perturbed mathematical programs and interval analysis
- Global optimization using interval arithmetic
- Primal-relaxed dual global optimization approach
- Parallel algorithms for global optimization
- Cord-slope form of Taylor's expansion in univariate global optimization
- A priority measure in interval methods for constrained global optimization
- Application of Bayesian approach to numerical methods of global and stochastic optimization
- An interval algorithm for constrained global optimization
- An interval algorithm for nondifferentiable global optimization
- The cluster problem in multivariate global optimization
- Box-splitting strategies for the interval Gauss-Seidel step in a global optimization method
- Topographical multilevel single linkage
- Global optimization conditions for certain nonconvex minimization problems
- Finding maximum likelihood estimators for the three-parameter Weibull distribution
- Minimum-volume ellipsoids containing compact sets: Application to parameter bounding
- Rigorous global search: continuous problems
- The convergence speed of interval methods for global optimization
- Guaranteed analysis and optimisation of parametric systems with application to their stability degree
- Robust analysis and design of control systems using interval arithmetic
- Formulation assistance for global optimization problems
- A sufficient condition for non-overestimation in interval arithmetic
- Application of stochastic global optimization algorithms to practical problems
- Numerical solution for bounding feasible point sets
- Applications of interval arithmetic in non-smooth global optimization
- Heuristic rejection in interval global optimization
- Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems
- Interval analysis: Theory and applications
- Interval mathematics, algebraic equations and optimization
- Improved upper bounds in the moving sofa problem
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Combining interval branch and bound and stochastic search
- Meta-heuristic interval methods of search of optimal in average control of nonlinear determinate systems with incomplete information about its parameters
- Numerical solutions for systems of qualitative' nonlinear algebraic equations by fuzzy logic
- Nonlinear equations and optimization
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- Value-estimation function method for constrained global optimization
- A hybrid global optimization method: The multi-dimensional case
- Parallel methods for verified global optimization practice and theory
- A hybrid global optimization method: The one-dimensional case
- Improved validated bounds for Taylor coefficients and for Taylor remainder series
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model
- Higher-order sensitivity analysis of finite element method by automatic differentiation
- A parallel interval method implementation for global optimization using dynamic load balancing
- Verified solution of large systems and global optimization problems
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- An algorithm for solving global optimization problems with nonlinear constraints
- Interval methods for global optimization
- An improved univariate global optimization algorithm with improved linear lower bounding functions
- If we measure a number, we get an interval. What if we measure a function or an operator?
- Interval extensions of non-smooth functions for global optimization and nonlinear systems solvers
- A deterministic approach to global box-constrained optimization
- Some old traditions in mathematics and in mathematical education
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
- A continuous location model for siting a non-noxious undesirable facility within a geographical region
- Novelty search for global optimization
- Solving interval linear least squares problems by PPS-methods
- An interval branch and bound method for global robust optimization
- Improved interval methods for solving circle packing problems in the unit square
- Development of modal interval algorithm for solving continuous minimax problems
- Numerical certification of Pareto optimality for biobjective nonlinear problems
- Global optimization to prescribed accuracy
- Development of metaheuristic interval minimization methods for optimal program control design
- Maximal perimeter, diameter and area of equilateral unit-width convex polygons
- On interval branch-and-bound for additively separable functions with common variables
- Stability and uniqueness of slowly oscillating periodic solutions to Wright's equation
- Geometric branch-and-bound methods for constrained global optimization problems
- The 1-center problem in the plane with independent random weights
- A novel three-phase trajectory informed search methodology for global optimization
- Extremal problems for convex polygons
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
- An exact global optimization method for deriving weights from pairwise comparison matrices
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- On the Asaithambi-Zuhe-Moore algorithm for computing the range of values
- Interval method for global solutions of a class of min-max-min problems
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 Q4040272)