A class of collinear scaling algorithms for bound-constrained optimization: Convergence theorems

Convergence theorems for a class of learning algorithms with VLRPs

We first consider the convergence of the simple competitive learning with vanishing learning rate parameters (VLRPs). Examples show that even in this setting the learning fails to converge in general. This brings us to consider the following problem: to find out a family of VLRPs such that an algorithm with the VLRPs reaches the global minima with probability one. Here, we present an approach d...

Global optimization algorithms for bound constrained problems

On the Convergence of Bound Optimization Algorithms

Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the general class of bound optimization algorithms – including EM, Iterative Scaling, Non-negative Matrix Factorization, CCCP – and their relationship to direct optimization algorithms such as gradientbased methods for paramete...

A Bound for the Nilpotency Class of a Lie Algebra

In the present paper, we prove that if L is a nilpotent Lie algebra whose proper subalge- bras are all nilpotent of class at most n, then the class of L is at most bnd=(d 1)c, where b c denotes the integral part and d is the minimal number of generators of L.

solution of security constrained unit commitment problem by a new multi-objective optimization method

چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...