Efficiency

  • Ding-Zhu Du
  • Panos M. Pardalos
  • Weili Wu
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 56)

Abstract

Global convergence indicates whether an algorithm is able to find an optimal or locally optimal solution for a nonlinear optimization problem. The rate of convergence is another mathematical measure which evaluates the computational efficiency of an iterative algorithm.

Keywords

Global Convergence Proper Subset Nonlinear Optimization Problem Quadratic Rate Convex Linear Combination 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Ding-Zhu Du
    • 1
  • Panos M. Pardalos
    • 2
  • Weili Wu
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of MinnesotaMinneapolisUSA
  2. 2.Center for Applied Optimization, ISE DepartmentUniversity of FloridaGainesvilleUSA

Personalised recommendations