Numerical solution for bounding feasible point sets
type: Item
instance of: scholarly article
title: Numerical solution for bounding feasible point sets
zbMATH Open document ID: 1022.65068
DOI: 10.1016/S0377-0427(02)00912-3
author: Peiliang Xu
published in: Journal of Computational and Applied Mathematics
publication date: 2003-07-29T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1956165
zbMATH Keywords: feasible point set
zbMATH Keywords: interval mathematics
zbMATH Keywords: multisection
zbMATH Keywords: multisplitting
zbMATH Keywords: numerical examples
zbMATH Keywords: algorithms
zbMATH Keywords: system of nonlinear and nonconvex inequalities
zbMATH Keywords: global optimization
describes a project that uses: INTOPT_90
MaRDI profile type: Publication
cites work: Enlarging the region of convergence of Newton's method for constrained optimization
cites work: A Gauss-Newton Approach to Solving Generalized Inequalities
cites work: A new multisection technique in interval methods for global optimization
cites work: Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
cites work: Newton's method for nonlinear inequalities
cites work: A Trust-Region Approach to Nonlinear Systems of Equalities and Inequalities
cites work: Deterministic global optimization. Theory, methods and applications
cites work: Global optimization using interval analysis - the multi-dimensional case
cites work: Q4004279
cites work: Q3323161
cites work: Q4211853
cites work: Heuristic search and pruning in polynomial constraints satisfaction
cites work: Safe starting regions by fixed points and tightening
cites work: Introduction to global optimization.
cites work: Q4889854
cites work: Interval constraint propagation with application to bounded-error estimation
cites work: Q2713275
cites work: Rigorous global search: continuous problems
cites work: Q4874513
cites work: On proving existence of feasible points in equality constrained optimization problems
cites work: Q4851623
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Q5566070
cites work: Q3796646
cites work: Derived eigenvalues of symmetric matrices, with applications to distance geometry
cites work: Gradient methods for solving equations and inequalities
cites work: Newton's method for the solution of systems of equalities and inequalities
cites work: Q4040272
cites work: Extension of Newton's method to nonlinear functions with values in a cone
cites work: Q4125663
cites work: Convex analysis and global optimization
cites work: Solving Polynomial Systems Using a Branch and Prune Approach
cites work: An interval algorithm for constrained global optimization
cites work: A hybrid global optimization method: The one-dimensional case
description: scientific article; zbMATH DE number 1956165