Convergence of the (GOP) algorithm for a large class of smooth optimization problems

Liu, Wenbin and Floudas, Christodoulos A. (1995) Convergence of the (GOP) algorithm for a large class of smooth optimization problems. Journal of Global Optimization, 6 (2). pp. 207-211. ISSN 0925-5001. (doi:https://doi.org/10.1007/BF01096769) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1007/BF01096769

Abstract

In this paper it is shown that the (GOP) algorithm is guaranteed to be convergent for a large class of smooth mathematical programming problems.

Item Type: Article
Uncontrolled keywords: GOP algorithm
Subjects: Q Science > Operations Research - Theory
Divisions: Faculties > Social Sciences > Kent Business School
Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Steve Wenbin Liu
Date Deposited: 27 Nov 2013 09:44 UTC
Last Modified: 07 Mar 2017 09:21 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/36851 (The current URI for this page, for reference purposes)
  • Depositors only (login required):