• Home
  • Search
  • A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
  • Cite Icon11
  • https://doi.org/10.1007/s12190-008-0117-5Copy DOI Icon

A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper, a modification of the BFGS algorithm for unconstrained nonconvex optimization is proposed. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the new quasi-Newton iteration equation Bk+1sk=yk*, where yk* is the sum of yk and tk‖g(xk)‖sk. The global convergence property of the algorithm associated with the general line search rule is prove.

Similar Papers
  • Addendum

Erratum to: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization

  • Feb 01, 2013
  • Optimization Methods and Software
  • Saman Babaie-Kafaki
  • Research Article
  • Citations11

Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization

  • Jul 01, 1978
  • Mathematics of Computation
  • Ph L Toint
  • Research Article
  • Citations40

Parallel variable metric algorithms for unconstrained optimization

  • Sep 01, 1985
  • Mathematical Programming
  • P J M Van Laarhoven
  • Research Article
  • Citations50

A multi-objective improved teaching-learning based optimization algorithm for unconstrained and constrained optimization problems

  • Jan 01, 2013
  • international journal of industrial engineering computations
  • R Venkata Rao +1
  • Conference Article
  • Citations9

An Adaptive Particle Swarm Algorithm for Unconstrained Global Optimization of Multimodal Functions

  • Feb 24, 2017
  • P Jiang +2
  • Research Article
  • Citations424

A Vector Angle-Based Evolutionary Algorithm for Unconstrained Many-Objective Optimization

  • Feb 01, 2017
  • IEEE Transactions on Evolutionary Computation
  • Yi Xiang +3
  • Research Article
  • Citations19

Random number generators in genetic algorithms for unconstrained and constrained optimization

  • Nov 20, 2008
  • Nonlinear Analysis
  • Andrea Reese
  • Research Article
  • Citations44

An adaptive conjugate gradient algorithm for large-scale unconstrained optimization

  • Jul 10, 2015
  • Journal of Computational and Applied Mathematics
  • Neculai Andrei
  • PDF
  • Research Article
  • Citations3

Enhanced Parallel Sine Cosine Algorithm for Constrained and Unconstrained Optimization

  • Apr 03, 2022
  • Mathematics
  • Akram Belazi +5
  • Research Article
  • Citations22

VXQR: derivative-free unconstrained optimization based on QR factorizations

  • Sep 11, 2010
  • Soft Computing
  • Arnold Neumaier +3
  • PDF
  • Research Article
  • Citations3

A Modified Class of Conjugate Gradient Algorithms Based on Quadratic Model for Nonlinear Unconstrained Optimization

  • Jul 01, 2014
  • AL-Rafidain Journal of Computer Sciences and Mathematics
  • Basim Hassan +1
  • Research Article
  • Citations40

A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization

  • Mar 01, 1995
  • ACM Transactions on Mathematical Software
  • R Baker Kearfott
  • Conference Article

A Weak Filled Function Algorithm for Unconstrained Searching Optimization

  • Nov 01, 2012
  • Guiyu Li +3
  • Research Article
  • Citations2

A quasi-Newton based pattern search algorithm for unconstrained optimization

  • Jul 25, 2006
  • Applied Mathematics and Computation
  • Ting Wu +1
  • Research Article
  • Citations421

Approximate solution of the trust region problem by minimization over two-dimensional subspaces

  • Jan 01, 1988
  • Mathematical Programming
  • Richard H Byrd +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.