A rapidly convergent five-point algorithm for univariate minimization

DOI10.1007/BF01585172zbMath0836.90136OpenAlexW2072542451MaRDI QIDQ1321651

Robert Mifflin, Jean Jacques Strodiot

Publication date: 23 May 1994

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

Full work available at URL: https://doi.org/10.1007/bf01585172

zbMATH Keywords

nonsmooth optimizationunivariate function

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Separating plane algorithms for convex optimization ⋮ On superlinear convergence in univariate nonsmooth minimization ⋮ A bracketing technique to ensure desirable convergence in univariate minimization

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bracketing technique to ensure desirable convergence in univariate minimization
• Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
• Nonpolynomial and Inverse Interpolation for Line Search: Synthesis and Convergence Rates
• Line Search Techniques Based on Interpolating Polynomials using Function Values Only
• Quadratic Interpolation is Risky
• Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
• The Hydrodynamic Resistance of a Fluid Sphere Submerged in Stokes Flows