Browsing by Keywords "Global optimization"
Now showing items 1-11 of 11
-
“Backward differential flow” may not converge to a global minimizer of polynomials
(Springer New York LLC, 2015)We provide a simple counter-example to prove and illustrate that the backward differential flow approach, proposed by Zhu, Zhao and Liu for finding a global minimizer of coercive even-degree polynomials, can converge to a ... -
A finite concave minimization algorithm using branch and bound and neighbor generation
(Springer, 1994)In this article we present a new finite algorithm for globally minimizing a concave function over a compact polyhedron. The algorithm combines a branch and bound search with a new process called neighbor generation. It is ... -
Levy walk evolution for global optimization
(ACM, 2008-07)A novel evolutionary global optimization approach based on adaptive covariance estimation is proposed. The proposed method samples from a multivariate Levy Skew Alpha-Stable distribution with the estimated covariance matrix ... -
On the optimality of stochastic signaling under an average power constraint
(IEEE, 2010-09-10)In this paper, stochastic signaling is studied for scalar valued binary communications systems over additive noise channels in the presence of an average power constraint. For a given decision rule at the receiver, the ... -
Optimal signaling and detector design for power constrained on-off keying systems in Neyman-Pearson framework
(IEEE, 2011)Optimal stochastic signaling and detector design are studied for power constrained on-off keying systems in the presence of additive multimodal channel noise under the Neyman-Pearson (NP) framework. The problem of jointly ... -
Optimization over the efficient set: four special cases
(Springer, 1994)Recently, researchers and practitioners have been increasingly interested in the problem (P) of maximizing a linear function over the efficient set of a multiple objective linear program. Problem (P) is generally a difficult ... -
Positioning algorithms for cooperative networks in the presence of an unknown turn-around time
(IEEE, 2011)This paper addresses the problem of single node positioning in cooperative network using hybrid two-way time-of-arrival and time-difference-of-arrival where, the turn-around time at the target node is unknown. Considering ... -
A problem space algorithm for single machine weighted tardiness problems
(Taylor & Francis Inc., 2003)We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood ... -
Randomized and rank based differential evolution
(IEEE, 2009-12)Many real world problems which can be assigned to the machine learning domain are inverse problems. The available data is often noisy and may contain outliers, which requires the application of global optimization. ... -
Steklov regularization and trajectory methods for univariate global optimization
(Springer, 2020)We introduce a new regularization technique, using what we refer to as the Steklov regularization function, and apply this technique to devise an algorithm that computes a global minimizer of univariate coercive functions. ... -
Time-delay estimation in multiple-input single-output systems
(IEEE, 2010)In this paper, the time-delay estimation problem is studied for multiple-input single-output (MISO) systems. First, a theoretical analysis is carried out by deriving the Cramer-Rao lower bound (CRLB) for time-delay estimation ...
