On optimum root-finding algorithms

J Rissanen

doi:10.1016/0022-247X(71)90031-X

J. Math. Anal. Appl.

Paper

01 Jan 1971

On optimum root-finding algorithms

View publication

Abstract

It has been shown that the so-called secant method for finding roots of real-valued functions has the greatest power among all algorithms using the same amount of information and satisfying a smoothness condition. © 1971.

Paper

A globally convergent lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

A.R. Conn, Nick Gould, et al.

Mathematics of Computation

Conference paper

Time development of AlGaAs single-quantum-well laser facet temperature on route to catastrophical breakdown

W.C. Tang, H. Rosen, et al.

SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991

Conference paper

Learning Reduced Order Dynamics via Geometric Representations

Imran Nasim, Melanie Weber

SCML 2024

Paper

On the complexity of some geometric problems in unbounded dimension

Nimrod Megiddo

Journal of Symbolic Computation

View all publications

Abstract

Related

A globally convergent lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

Time development of AlGaAs single-quantum-well laser facet temperature on route to catastrophical breakdown

Learning Reduced Order Dynamics via Geometric Representations

On the complexity of some geometric problems in unbounded dimension