نتایج جستجو برای: smooth cost functions

تعداد نتایج: 967405  

2010
Jong-Bae Park Ki-Song Lee Kwang Y. Lee

Absfmct-This paper presents a new approach to economic load dispatch (ELD) problems with non-smwth objective functions using a particle swarm optimization (PSO). In practice, ELD problems have non-smooth objective functions with equality and inequality constraints that make it difficult to find the global optimum using any mathematical approaches. In this paper, a new PSO framework is suggested...

2001
Mila Nikolova

We present a theoretical study of the recovery of images x from noisy data y by minimizing a regularized cost-function F(x, y) = Ψ(x, y) + αΦ(x), where Ψ is a data-£delity term, Φ is a smooth regularization term and α > 0 is a parameter. Generally, Ψ is a smooth function; only a few papers make an exception. Non-smooth data-£delity terms are avoided in image processing. In spite of this, we con...

Journal: :علوم و فناوری فضایی 0
a. jafarsalehi m. mirshams r. emami

this paper focuses upon the development of an efficient method for conceptual design optimization of a satellite. there are many option for a satellite subsystems that could be choice, as acceptable solution to implement of a space system mission. every option should be assessment based on the different criteria such as cost, mass, reliability and technology contraint (complexity). in this rese...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان - دانشکده مهندسی عمران 1387

در این پایان نامه روش جدیدی مبتنی بر روش حل معادلات دیفرانسیل پارهای بر اساس روش توابع پایه برای حل مسایل ارتعاش اجباری واستاتیک تیرها و صفحات لایه ای ارایه شده است که می توان تفاوت این روش با روش های متداول توابع پایه را در استفاده از توابع هموار در ارضاء معادلات حاکم و شرایط مرزی دانست. در روش ارایه شده در این پایاننامه از معادله تعادل به عنوان معادله حاکم بر رفتار سیستم استفاده شده است که مو...

Journal: :Oper. Res. Lett. 2007
Philippe Mahey Maurício C. de Souza

We consider here a multicommodity flow network optimization problem with nonconvex but piecewise convex arc cost functions. We derive complete optimality conditions for local minima based on negative-cost cycles associated with each commodity. These conditions do not extend to the convex non-smooth case.

Journal: :Applied and Computational Harmonic Analysis 2001

Journal: :Annual Review of Public Health 1984

Journal: :Bulletin of the American Mathematical Society 1975

2012
R. Garmanjani L. N. Vicente

In the context of the derivative-free optimization of a smooth objective function, it has been shown that the worst case complexity of direct-search methods is of the same order as the one of steepest descent for derivative-based optimization, more precisely that the number of iterations needed to reduce the norm of the gradient of the objective function below a certain threshold is proportiona...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید