A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
From MaRDI portal
Publication:4768565
DOI10.2307/2005926zbMATH Open0282.65042OpenAlexW4234564249MaRDI QIDQ4768565FDOQ4768565
Authors: Jorge J. Moré, J. E. jun. Dennis
Publication date: 1974
Full work available at URL: https://doi.org/10.2307/2005926
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10)
Cites Work
- A new approach to variable metric algorithms
- Title not available (Why is that?)
- Unified approach to quadratically convergent algorithms for function minimization
- On the Convergence of the Variable Metric Algorithm
- An effective algorithm for minimization
- Methods of conjugate directions versus quasi-Newton methods
Cited In (only showing first 100 items - show all)
- Root finding by high order iterative methods based on quadratures
- Convergence properties of the Broyden-like method for mixed linear-nonlinear systems of equations
- An adaptive scaled BFGS method for unconstrained optimization
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
- The global convergence of a modified BFGS method for nonconvex functions
- The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden
- A class of factorization update algorithm for solving systems of sparse nonlinear equations
- A nonmonotone PSB algorithm for solving unconstrained optimization
- On the superlinear convergence of the successive approximations method
- On the convergence of a process basing on the modified secant method
- Inexact perturbed Newton methods and applications to a class of Krylov solvers
- A double parameter scaled BFGS method for unconstrained optimization
- Solving nonlinear equations with a direct Broyden method and its acceleration
- Modifying the BFGS method
- Convergence of Broyden-like matrix
- Optimization methods for large-scale machine learning
- A globally convergent incremental Newton method
- Geometric notes on optimization with equality constraints
- Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
- Preconditioned Newton methods using incremental unknowns methods for the resolution of a steady-state Navier-Stokes-like problem
- Some efficient algorithms for unconstrained discrete-time optimal control problems
- A Newton-type univariate optimization algorithm for locating the nearest extremum
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
- An inexact Newton method for nonlinear two-point boundary-value problems
- Subspace selection algorithms to be used with the nonlinear projection methods in solving systems of nonlinear equations
- On averaging and representation properties of the BFGS and related secant updates
- On a monotone Newton-like method
- Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem
- Stable factorized quasi-Newton methods for nonlinear least-squares problems
- Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization
- A smoothing Broyden-like method for the mixed complementarity problems
- A filter method for solving nonlinear complementarity problems based on derivative-free line search
- A new structured quasi-Newton algorithm using partial information on Hessian
- Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations
- Superlinear convergence of Broyden's boundedθ-class of methods
- A pointwise quasi-Newton method for unconstrained optimal control problems
- A superlinearly convergent algorithm for minimization without evaluating derivatives
- A globally and superlinearly convergent quasi-Newton method for general box constrained variational inequalities without smoothing approximation
- An algorithm for discrete linear \(L_ p\) approximation
- A new modified BFGS method for unconstrained optimization problems
- An improved quasi-newton method for unconstrained optimization
- The projection method for solving nonlinear systems of equations under the most violated constraint control
- A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
- A regularized limited memory BFGS method for nonconvex unconstrained minimization
- The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- Rates of convergence for adaptive Newton methods
- Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations
- Local and superlinear convergence for truncated iterated projections methods
- A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization)
- Solution of nonlinear systems of equations by an optimal projection method
- Two-level Newton's method for nonlinear elliptic PDEs
- A Riemannian subspace BFGS trust region method
- Practical quasi-Newton methods for solving nonlinear systems
- A quasi-Newton method for solving nonlinear algebraic equations
- The Sequential Quadratic Programming Method
- Direct Secant Updates of Matrix Factorizations
- A primal-dual interior-point algorithm for nonlinear least squares constrained problems
- The Newton-arithmetic mean method for the solution of systems of nonlinear equations.
- The inexact, inexact perturbed, and quasi-Newton methods are equivalent models
- A smoothing quasi-Newton method for solving general second-order cone complementarity problems
- On the local convergence of adjoint Broyden methods
- A spectral algorithm for large-scale systems of nonlinear monotone equations
- Global convergence of quasi-Newton methods based on adjoint Broyden updates
- A BFGS trust-region method for nonlinear equations
- Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations
- Majorizing Sequences and Error Bounds for Iterative Methods
- On the Convergence of a Quasi-Newton Method for Sparse Nonlinear Systems
- Factorized quasi-Newton methods for nonlinear least squares problems
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- A geometric method in nonlinear programming
- Local properties of algorithms for minimizing nonsmooth composite functions
- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function
- BFGS trust-region method for symmetric nonlinear equations
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- Global convergence and stabilization of unconstrained minimization methods without derivatives
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- Local convergence of quasi-Newton methods for B-differentiable equations
- Global approximate Newton methods
- On superlinear convergence of quasi-Newton methods for nonsmooth equations
- Some convergence properties of descent methods
- Interpolation by conic model for unconstrained optimization
- A modified BFGS method and its global convergence in nonconvex minimization
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations
- A global convergent quasi-Newton method for systems of monotone equations
- Quasi-Newton methods in infinite-dimensional spaces and application to matrix equations
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Combining trust-region techniques and Rosenbrock methods to compute stationary points
- Finding plasma equilibria with magnetic islands
- Difference Newton-like methods under weak continuity conditions
- A family of variable metric proximal methods
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- Comments on: ``A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations
- Convergence of Newton-like-iterative methods
- Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- A projection method for convex constrained monotone nonlinear equations with applications
This page was built for publication: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4768565)