Simple linkage: Analysis of a threshold-accepting global optimization methodJournal of Global Optimization - Tập 9 - Trang 95-111 - 1996
M. Locatelli, F. Schoen
In a recent paper the authors introduced an infinite class of global optimization algorithms based upon random sampling from the feasible region and local searches started from selected sample points, based upon an acceptance/rejection criterion. All of the algorithms of that class possess strong theoretical properties. Here we analyze a member of that family, which, although being significantly s...... hiện toàn bộ
Augmented Lagrangian Duality and Nondifferentiable Optimization Methods in Nonconvex ProgrammingJournal of Global Optimization - - 2002
Rafail N. Gasimov
In this paper we present augmented Lagrangians for nonconvex minimization problems with equality constraints. We construct a dual problem with respect to the presented here Lagrangian, give the saddle point optimality conditions and obtain strong duality results. We use these results and modify the subgradient and cutting plane methods for solving the dual problem constructed. Algorithms proposed ...... hiện toàn bộ
A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence caseJournal of Global Optimization - Tập 3 - Trang 95-111 - 1993
Harold P. Benson
The algorithms and algorithmic ideas currently available for globally optimizing linear functions over the efficient sets of multiple objective linear programs either use nonstandard subroutines or cannot yet be implemented for lack of sufficient development. In this paper a Bisection-Extreme Point Search Algorithm is presented for globally solving a large class of such problems. The algorithm fin...... hiện toàn bộ
Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraintsJournal of Global Optimization - Tập 49 - Trang 293-311 - 2010
Xinzhen Zhang, Chen Ling, Liqun Qi
This paper studies the relationship between the so-called bi-quadratic optimization problem and its semidefinite programming (SDP) relaxation. It is shown that each r-bound approximation solution of the relaxed bi-linear SDP can be used to generate in randomized polynomial time an
$${\mathcal{O}(r)}$$
-ap...... hiện toàn bộ
Application of the sequential parametric convex approximation method to the design of robust trussesJournal of Global Optimization - Tập 68 - Trang 169-187 - 2016
Alfredo Canelas, Miguel Carrasco, Julio López
We study an algorithm recently proposed, which is called sequential parametric approximation method, that finds the solution of a differentiable nonconvex optimization problem by solving a sequence of differentiable convex approximations from the original one. We show as well the global convergence of this method under weaker assumptions than those made in the literature. The optimization method i...... hiện toàn bộ
Survivable network design under optimal and heuristic interdiction scenariosJournal of Global Optimization - Tập 38 - Trang 181-199 - 2006
J. Cole. Smith, Churlzu Lim, Fransisca Sudargho
We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular, we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first to construct a network ...... hiện toàn bộ