Nonlinear equations and optimization

DOI10.1016/0898-1221(93)90288-7zbMath0770.65037OpenAlexW1984717185MaRDI QIDQ1802504

G. William Walster, Eldon R. Hansen

Publication date: 21 July 1993

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(93)90288-7

zbMATH Keywords

algorithmsglobal optimizationnonlinear optimizationnonlinear equationsInterval analysis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30)

Related Items

Computing slope enclosures by exploiting a unique point of inflection, On the algebraic solution of fuzzy linear systems based on interval theory, Probability bounds analysis for nonlinear population ecology models, Interval robust multi-objective algorithm, Competitive facility location and design with reactions of competitors already in the market, What can interval analysis do for global optimization?, A deteriorating multi-item inventory model with fuzzy costs and resources based on two different defuzzification techniques, A dynamic convexized method for nonconvex mixed integer nonlinear programming, Bounds for Lagrange multipliers and optimal points, Towards ``Ideal multistart. A stochastic approach for locating the minima of a continuous function inside a bounded domain, An efficient algorithm for range computation of polynomials using the Bernstein form, Interval mathematics, algebraic equations and optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interval Newton method
• New techniques for the analysis of linear interval equations
• A symmetric iterative interval method for systems of nonlinear equations
• Some algorithms for the solution of a class of nonlinear algebraic equations
• Interval iteration for zeros of systems of equations
• A class of interval-Newton-operators
• Am improved form of the Krawczyk-Moore algorithm
• Interval Newton operators for function strips
• Inclusion functions and global optimization. II
• Global optimization using interval analysis - the multi-dimensional case
• Bounding the slope of polynomial operators and some applications
• Strong solvability of interval linear programming problems
• Interval boxes of solutions of nonlinear systems
• Bounding solutions of systems of equations using interval analysis
• On computing the range of values
• Interval mathematics. Proceedings of the international symposium, Karlsruhe, West Germany, May 20-24, 1975
• Interval forms of Newtons method
• An interval arithmetic method for global optimization
• Bounds for Lagrange multipliers and optimal points
• On the solution of linear algebraic equations with interval coefficients
• Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
• Interval Slopes for Rational Functions and Associated Centered Forms
• Inclusion functions and global optimization
• Some Computable Existence, Uniqueness, and Convergence Tests for Nonlinear Systems
• A Note on the Algorithm of Alefeld and Platzöder for Systems of Nonlinear Equations
• A Modification of Krawczyk’s Algorithm
• Bounding Global Minima
• A Test for Existence of Solutions to Nonlinear Systems
• Safe Starting Regions for Iterative Methods
• A globally convergent interval method for computing and bounding real roots
• A Quadratically Convergent Krawczyk-Like Algorithm
• A Note on the Moore Test for Nonlinear Systems
• Computable error bounds for nonlinear programming
• Interval Arithmetic in Matrix Computations, Part II
• On Solving Systems of Equations Using Interval Arithmetic
• Robust analysis and global optimization