Convergence of Subtangent-Based Relaxations of Nonlinear Programs

Convergence of Subtangent-Based Relaxations of Nonlinear Programs

Convex relaxations of functions are used to provide bounding information to deterministic global optimization methods for nonconvex systems. To be useful, these relaxations must converge rapidly to the original system as the considered domain shrinks. This article examines the convergence rates of c...

Full description

Bibliographic Details
Main Authors: Huiyi Cao, Yingkai Song, Kamil A. Khan
Format: Article
Language:English
Published: MDPI AG 2019-04-01
Series:Processes
Subjects:
deterministic global optimization
convex relaxations
affine relaxations
subgradients
cutting planes
Online Access:https://www.mdpi.com/2227-9717/7/4/221

Internet

https://www.mdpi.com/2227-9717/7/4/221

Similar Items