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)
- 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
- Minimizing a differentiable function over a differential manifold
- The column-updating method for solving nonlinear equations in Hilbert space
- A Riemannian view on shape optimization
- A quasi-Gauss-Newton method for solving nonlinear algebraic equations
- Convergence analysis of a modified BFGS method on convex minimizations
- On preconditioned Uzawa methods and SOR methods for saddle-point problems
- An extension of the theory of secant preconditioners
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
- Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
- New line search methods for unconstrained optimization
- Parallel quasi-Newton methods for unconstrained optimization
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Analysis of a self-scaling quasi-Newton method
- Enlarging the region of convergence of Newton's method for constrained optimization
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
- Incomplete Jacobian Newton method for nonlinear equations
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Properties of updating methods for the multipliers in augmented Lagrangians
- A globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications
- Spectral gradient projection method for solving nonlinear monotone equations
- Inexact Newton methods for solving nonsmooth equations
- Block BFGS methods
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
- A three-term derivative-free projection method for nonlinear monotone system of equations
- New quasi-Newton methods for unconstrained optimization problems
- A quasi-Newton method with modification of one column per iteration
- A nonmonotone filter SQP method: local convergence and numerical results
- Variable metric methods for unconstrained optimization and nonlinear least squares
- A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
- Higher-order metric subregularity and its applications
- Sparse quasi-Newton updates with positive definite matrix completion
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
- Local and superlinear convergence of quasi-Newton methods based on modified secant conditions
- Local convergence analysis for partitioned quasi-Newton updates
- Hölder strong metric subregularity and its applications to convergence analysis of inexact Newton methods
- Inexact free derivative quasi-Newton method for large-scale nonlinear system of equations
- 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
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)