Skip to main content

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

Liu, Wenbin, 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: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) (KAR id:36851)

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.
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
DOI/Identification number: 10.1007/BF01096769
Uncontrolled keywords: GOP algorithm
Subjects: Q Science > Operations Research - Theory
Divisions: Divisions > Kent Business School - Division > Kent Business School (do not use)
Depositing User: Steve Liu
Date Deposited: 27 Nov 2013 09:44 UTC
Last Modified: 16 Nov 2021 10:13 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/36851 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.