scientific article
From MaRDI portal
Publication:4040272
zbMath0648.65049MaRDI QIDQ4040272
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global optimizationunconstrained optimizationconvergencenumerical examplestextbooknonlinear optimizationunbounded domainsinterval arithmetic
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)
Related Items (only showing first 100 items - show all)
Application of Bayesian approach to numerical methods of global and stochastic optimization ⋮ A new multi-section based technique for constrained optimization problems with interval-valued objective function ⋮ Improved upper bounds in the moving sofa problem ⋮ 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 ⋮ Optimal circle covering problems and their applications ⋮ Minimum-volume ellipsoids containing compact sets: Application to parameter bounding ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ The convergence speed of interval methods for global optimization ⋮ Location equilibria for a continuous competitive facility location problem under delivered pricing ⋮ The small octagon with longest perimeter ⋮ Experiments with range computations using extrapolation ⋮ 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 ⋮ A verified method for bounding clusters of zeros of analytic functions ⋮ Interval methods for verifying structural optimality of circle packing configurations in the unit square ⋮ Empirical convergence speed of inclusion functions for facility location problems ⋮ Two acceleration mechanisms in verified 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 ⋮ Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ Solving interval constraints by linearization in computer-aided design ⋮ A search algorithm for calculating validated reliability bounds ⋮ A new exclusion test for finding the global minimum ⋮ Formulation assistance for global optimization problems ⋮ A sufficient condition for non-overestimation in interval arithmetic ⋮ Application of stochastic global optimization algorithms to practical problems ⋮ Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure ⋮ The theoretical and empirical rate of convergence for geometric branch-and-bound methods ⋮ Study of multiscale global optimization based on parameter space partition ⋮ Numerical solution for bounding feasible point sets ⋮ Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach ⋮ Applications of interval arithmetic in non-smooth global optimization ⋮ A global optimization procedure for the location of a median line in the three-dimensional space ⋮ Heuristic rejection in interval global optimization ⋮ Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods ⋮ An interval algorithm for multi-objective optimization ⋮ Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials ⋮ Competitive facility location and design with reactions of competitors already in the market ⋮ Unified set membership theory for identification, prediction and filtering of nonlinear systems ⋮ Topological quasilinear spaces ⋮ Computational complexity of iterated maps on the interval ⋮ Extended interval Newton method based on the precise quotient set ⋮ A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms ⋮ On interval enclosures using slope arithmetic ⋮ An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming ⋮ Combining interval branch and bound and stochastic search ⋮ Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems ⋮ 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? ⋮ A reliable affine relaxation method for global optimization ⋮ Unconstrained and constrained global optimization of polynomial functions in one variable ⋮ Some feasibility sampling procedures in interval methods for constrained global optimization ⋮ Meta-heuristic interval methods of search of optimal in average control of nonlinear determinate systems with incomplete information about its parameters ⋮ GBSSS: The generalized big square small square method for planar single- facility location ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Efficient interval partitioning for constrained global optimization ⋮ Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models ⋮ Theoretical rate of convergence for interval inclusion functions ⋮ The extrapolated interval global optimization algorithm ⋮ Lipschitz and Hölder global optimization using space-filling curves ⋮ On the complexity of exclusion algorithms for optimization ⋮ Verifying topological indices for higher-order rank deficiencies ⋮ Numerical solutions for systems of qualitative' nonlinear algebraic equations by fuzzy logic ⋮ Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms ⋮ Comparison between Baumann and admissible simplex forms in interval analysis ⋮ 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 ⋮ Nonlinear equations and optimization ⋮ The impact of accelerating tools on the interval subdivision algorithm for global optimization ⋮ Set inversion via interval analysis for nonlinear bounded-error estimation ⋮ Value-estimation function method for constrained global optimization ⋮ Problem-method classification in optimization and control ⋮ A gentle introduction to Numerica ⋮ 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 one-dimensional optimization using smooth auxiliary functions ⋮ On proving existence of feasible points in equality constrained optimization problems ⋮ Interval analysis: Theory and applications ⋮ Interval mathematics, algebraic equations and optimization ⋮ 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 ⋮ Interval tools for global optimization ⋮ 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
This page was built for publication:
