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

On convex relaxations of quadrilinear terms

Sonia Cafieri, Jon Lee, et al.

Journal of Global Optimization

Conference paper

Optimization of real phase-mask performance

F.M. Schellenberg, M. Levenson, et al.

BACUS Symposium on Photomask Technology and Management 1991

Conference paper

On a partial ordering relation derived from redundancy of Slepian-Wolf coding

Da-Ke He, Ashish Jagmohan, et al.

ISIT 2007

Talk

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization

Trang H. Tran, Lam Nguyen, et al.

INFORMS 2022

View all publications

Abstract

Related

On convex relaxations of quadrilinear terms

Optimization of real phase-mask performance

On a partial ordering relation derived from redundancy of Slepian-Wolf coding

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization