# Newton

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2011

Highly Cited

2011

- IEEE Conference on Decision and Control and…
- 2011

We present a Newton-based extremum seeking algorithm for the multivariable case. The design extends the recent Newton-based… (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- 2010

Quasi-Newton methods accelerate the steepest-descent technique for function minimization by using computational history to… (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- 2010

We study how to use the BFGS quasi-Newton matrices to precondition minimization methods for problems where the storage is… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- SIAM J. Scientific Computing
- 2002

Inexact Newton algorithms are commonly used for solving large sparse nonlinear system of equations F (u∗) = 0 arising, for… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- SIAM Review
- 1995

This expository paper traces the development of the Newton-Raphson method for solving nonlinear algebraic equations through the… (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Math. Program.
- 1994

We consider a new algorithm, an interior-reflective Newton approach, for the problem of minimizing a smooth nonlinear function of… (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- SIAM Journal on Optimization
- 1994

Inexact Newton methods for finding a zero of F 1 1 are variations of Newton's method in which each step only approximately… (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Math. Program.
- 1994

We derive compact representations of BFGS and symmetric rank one matrices for optimization These representations allow us to e… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Math. Program.
- 1993

Newton's method for solving a nonlinear equation of several variables is extended to a nonsmooth case by using the generalized… (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- 1981 20th IEEE Conference on Decision and Control…
- 1981

We consider the problem min {f(x)|x ¿ 0} and algorithms of the form xk+1 = [xk - ¿k Dk¿f(xk)]+ where [¿]+ denotes projection on… (More)

Is this relevant?