The resolution of close minima

DOI10.1016/0898-1221(93)90281-YzbMATH Open0776.65048MaRDI QIDQ1802496FDOQ1802496

Authors: Yanyan Li 

Publication date: 1 December 1993

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

Recommendations

• A new interval method for locating the boundary of level sets
• scientific article; zbMATH DE number 3844490
• Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions
• scientific article; zbMATH DE number 3876495
• On discrete minimax problems in \(\mathbb{R}\) using interval arithmetic

zbMATH Keywords

global optimizationglobal minimizersinterval Newton methodinterval computation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Interval and finite arithmetic (65G30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A globally convergent interval method for computing and bounding real roots
• Numerical experiments with one-dimensional adaptive cubic algorithm

Cited In (3)

• Title not available (Why is that?)
• Maximal minimal resolutions
• Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions

This page was built for publication: The resolution of close minima

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802496)