A bracketing technique to ensure desirable convergence in univariate minimization

DOI10.1007/BF01582285zbMath0663.90078MaRDI QIDQ1115354

Robert Mifflin, Jean Jacques Strodiot

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

rate of convergencesuperlinear convergencelower semicontinuous functionone-dimensional optimizationthree-point iterative processes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Separating plane algorithms for convex optimization ⋮ On superlinear convergence in univariate nonsmooth minimization ⋮ A rapidly convergent five-point algorithm for univariate minimization

Uses Software

• BRENT

Cites Work

• A rapidly convergent five-point algorithm for univariate minimization
• Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
• Quadratic Interpolation is Risky
• Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item