The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
From MaRDI portal
Publication:3865385
DOI10.1137/0717011zbMath0428.65040OpenAlexW2056293789MaRDI QIDQ3865385
Publication date: 1980
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0717011
algorithmsunconstrained optimizationquasi-Newton methodssuperlinear rate of convergenceoptimization by collinear scaling
Related Items (37)
On Davidon's collinear scaling algorithms for optimization ⋮ A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems ⋮ Interpolation by conic model for unconstrained optimization ⋮ A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization ⋮ A quasi-Newton trust region method with a new conic model for the unconstrained optimization ⋮ Two globally convergent nonmonotone trust-region methods for unconstrained optimization ⋮ A trust region method with a conic model for nonlinearly constrained optimization ⋮ A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization ⋮ A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy ⋮ On accelerating Newton's method based on a conic model ⋮ A numerical evaluation of some collinear scaling algorithms for unconstrained ⋮ Unnamed Item ⋮ A nonmonotone adaptive trust region method for unconstrained optimization based on conic model ⋮ A model-hybrid approach for unconstrained optimization problems ⋮ Local andQ-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡ ⋮ Combining nonmonotone conic trust region and line search techniques for unconstrained optimization ⋮ A modified Newton-like method for nonlinear equations ⋮ A trust-region method with a conic model for unconstrained optimization ⋮ A nonmonotone trust-region method of conic model for unconstrained optimization ⋮ An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization ⋮ Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization ⋮ A new hybrid method for nonlinear complementarity problems ⋮ Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms ⋮ A nonmonotone conic trust region method based on line search for solving unconstrained optimization ⋮ An adaptive conic trust-region method for unconstrained optimization ⋮ Unnamed Item ⋮ A variant of trust-region methods for unconstrained optimization ⋮ A smoothing conic trust region filter method for the nonlinear complementarity problem ⋮ A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results ⋮ A simple approximated solution method for solving fractional trust region subproblems of nonlinearly equality constrained optimization ⋮ Unnamed Item ⋮ A subspace minimization conjugate gradient method based on conic model for unconstrained optimization ⋮ Nonmonotone conic trust region method with line search technique for bound constrained optimization ⋮ A CONIC AFFINE SCALING DOGLEG METHOD FOR NONLINEAR OPTIMIZATION WITH BOUND CONSTRAINTS ⋮ An adaptive approach of conic trust-region method for unconstrained optimization problems ⋮ Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function ⋮ New quasi-Newton equation and related methods for unconstrained optimization
This page was built for publication: The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
