نتایج جستجو برای: penalty functions

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

1996

This paper describes penalty search based on a modified neighborhood search where move and solution penalty functions attempt to keep the search process out of recently "explored" regions. During the penalty search process trajectories which may cause a cycle or drive the search process towards recently found local optimums are made "less attractive" by using penalty parameters. Penalty search ...

Journal: :international journal of advanced design and manufacturing technology 0
gholamhosein baradaran mohamadjavad mahmoudabadi mohamadmehdi sarfarazi

a truly meshless local petrov-galerkin (mlpg) method is developed for solving 3d elasto-static problems. using the general mlpg concept, this method is derived through the local weak forms of the equilibrium equations, by using test functions, namely, the heaviside function. the moving least squares (mls) are chosen to construct the shape functions, for the mlpg method. the penalty approximatio...

2012
Zhihua Zhang Bojun Tu

In this paper we study sparsity-inducing nonconvex penalty functions using Lévy processes. We define such a penalty as the Laplace exponent of a subordinator. Accordingly, we propose a novel approach for the construction of sparsityinducing nonconvex penalties. Particularly, we show that the nonconvex logarithmic (LOG) and exponential (EXP) penalty functions are the Laplace exponents of Gamma a...

1996
Juha-Miikka Nurmilaakso

This paper describes penalty search based on a modified neighborhood search where move and solution penalty functions attempt to keep the search process out of recently "explored" regions. During the penalty search process trajectories which may cause a cycle or drive the search process towards recently found local optimums are made "less attractive" by using penalty parameters. Penalty search ...

2015
X. Q. Yang Z. Y. Chen J. C. Zhou

In this paper, we will study optimality conditions of semi-infinite programs and generalized semi-infinite programs, for which the gradient objective function when evaluated at any feasible direction for the linearized constraint set is non-negative. We consider three types of penalty functions for semi-infinite program and investigate the relationship among the exactness of these penalty funct...

2016
Muhammad Asif Jan Nasser Mansoor Tairan Rashida Adeeb Khanum Wali Khan Mashwani

This paper compares the performance of our recently proposed threshold based penalty function against its dynamic and adaptive variants. These penalty functions are incorporated in the update and replacement scheme of the multiobjective evolutionary algorithm based on decomposition (MOEA/D) framework to solve constrained multiobjective optimization problems (CMOPs). As a result, the capability ...

2012
Christian Banz Peter Pirsch Holger Blume

The stereo matching method semi-global matching (SGM) relies on consistency constraints during the cost aggregation which are enforced by so-called penalty terms. This paper proposes new and evaluates four penalty functions for SGM. Due to mutual dependencies, two types of matching cost calculation, census and rank transform, are considered. Performance is measured using original and degenerate...

Journal: :Journal of the Operations Research Society of Japan 1985

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

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