Local convergence

Known as: Global convergence, Locally convergent 
In numerical analysis, an iterative method is called locally convergent if the successive approximations produced by the method are guaranteed to… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
A local convergence theorem for calculating canonical low-rank tensor approximations (PARAFAC, CANDECOMP) by the alternating… (More)
  • figure 4.1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The concave-convex procedure (CCCP) is a majorization-minimization algorithm that solves d.c. (difference of convex functions… (More)
Is this relevant?
2007
2007
Traditionally Evolutionary Algorithms (EAs) choose candidate solutions based on their individual fitnesses, usually without… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Recently, nonlinear programming solvers have been used to solve a range of mathematical programs with equilibrium constraints… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A line search method is proposed for nonlinear programming using Fletcher and Leyffer’s filter method, which replaces the… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We examine the local convergence properties of pattern search methods, complementing the previously established global… (More)
  • figure 2.1
  • table 5.1
  • table 5.2
  • figure 6.1
  • figure 6.2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We consider the problem of finding a solution of a constrained (and not necessarily square) system of equations, i.e., we… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
An example of SDPs (semide nite programs) exhibits a substantial di culty in proving the superlinear convergence of a direct… (More)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We introduce an abstract deenition of pattern search methods for solving nonlinear unconstrained optimization problems. Our… (More)
Is this relevant?