Lagrange Duality and Partitioning Techniques in Nonconvex Global Optimization

1997 ◽  
Vol 95 (2) ◽  
pp. 347-369 ◽  
Author(s):  
M. Dür ◽  
R. Horst
Keyword(s):  
Global Optimization ◽  
Lagrange Duality ◽  
Nonconvex Global Optimization

scholarly journals Nonsmooth nonconvex global optimization in a Banach space with a basis

2004 ◽  
Vol 48 (1-2) ◽  
pp. 131-144 ◽  
Author(s):  
A. Balbás ◽  
E. Galperin ◽  
P. Jiménez Guerra
Keyword(s):  
Banach Space ◽  
Global Optimization ◽  
Nonconvex Global Optimization

scholarly journals A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem

2016 ◽  
Vol 2016 ◽  
pp. 1-8
Author(s):  
Mio Horai ◽  
Hideo Kobayashi ◽  
Takashi G. Nitta
Keyword(s):  
Global Optimization ◽  
Global Convergence ◽  
Nonlinear Optimization ◽  
Branch And Bound ◽  
Nonconvex Optimization ◽  
Optimization Problem ◽  
New Method ◽  
Linear Relaxation ◽  
Global Optimization Problem ◽  
Nonconvex Global Optimization

We propose a new method for the specific nonlinear and nonconvex global optimization problem by using a linear relaxation technique. To simplify the specific nonlinear and nonconvex optimization problem, we transform the problem to the lower linear relaxation form, and we solve the linear relaxation optimization problem by the Branch and Bound Algorithm. Under some reasonable assumptions, the global convergence of the algorithm is certified for the problem. Numerical results show that this method is more efficient than the previous methods.

Sign in / Sign up

Export Citation Format

Share Document