نتایج جستجو برای: barrier function method

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

Journal: :J. Global Optimization 2000
Chuangyin Dang Lei Xu

Abstract. In this paper a barrier function method is proposed for approximating a solution of the nonconvex quadratic programming problem with box constraints. The method attempts to produce a solution of good quality by following a path as the barrier parameter decreases from a sufficiently large positive number. For a given value of the barrier parameter, the method searches for a minimum poi...

Journal: :Neural computation 2002
Chuangyin Dang Lei Xu

A Lagrange multiplier and Hopfield-type barrier function method is proposed for approximating a solution of the traveling salesman problem. The method is derived from applications of Lagrange multipliers and a Hopfield-type barrier function and attempts to produce a solution of high quality by generating a minimum point of a barrier problem for a sequence of descending values of the barrier par...

Journal: :J. Computational Applied Mathematics 2015
Atsushi Kato Hiroshi Yabe Hiroshi Yamashita

In this paper, we consider an interior point method for nonlinear semidefinite programming. Yamashita, Yabe and Harada presented a primal-dual interior point method in which a nondifferentiable merit function was used. By using shifted barrier KKT conditions, we propose a differentiable primal-dual merit function within the framework of the line search strategy, and prove the global convergence...

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

اندازه گیریهای پراش نوترون (با طول موج ‏‎0/7 a‎‏) در محدوده وسیعی از دما روی ماده سیکلوهگزان که شامل فازهای ‏‎liquid crystal‎‏، ‏‎‏‎palstic crystal‎‏‎‏ و ‏‎brittle‎‏ می باشد، در این پایان نامه ارائه میشود. تحلیل داده ها نشان می دهد که ساختار در رفتار مولکول به سابقه و وضعییت قبلی آن مربوط است. در فصل اول به بررسی تئوری پراکندگی و در فصل دوم به بررسی پراکندگی مغناطیسی می پردازیم. در فصل سوم به ت...

Journal: :Math. Program. 2012
Hiroshi Yamashita Hiroshi Yabe Kouhei Harada

In this paper, we consider a primal-dual interior point method for solving nonlinear semidefinite programming problems. By combining the primal barrier penalty function and the primal-dual barrier function, a new primal-dual merit function is proposed within the framework of the line search strategy. We show the global convergence property of our method.

Journal: :international journal of environmental research 2015
e. sánchez-badorrey i. jalón-rojas

this paper presents a new methodology for the zoning of littoral sand barriers on the basis oftheir groundwater dynamic responses to the local mean water level (mwl) climate. the method is based onthe comparison of the characteristic scales of the horizontal drainage and recharge processes. using theboussinesq equation and basic hydro-geomorphological parameters, this methodology identifies the...

2002
L. Jensen R. A. Polyak

We show, using elementary considerations, that a modified barrier function method for the solution of convex programming problems converges for any fixed positive setting of the barrier parameter. With mild conditions on the primal and dual feasible regions, we show how to use the modified barrier function method to obtain primal and dual optimal solutions, even in the presence of degeneracy. W...

Journal: :Mathematical Programming 2010

1991
D. den Hertog C. Roos T. Terlaky

In the recent interior point methods for linear programming much attention has been given to the logarithmic barrier method. In this paper we will analyse the class of inverse barrier methods for linear programming, in which the barrier is P x r i , where r > 0 is the rank of the barrier. There are many similarities with the logarithmic barrier method. The minima of an inverse barrier function ...

2003
Szewan Lam Duan Li Shuzhong Zhang

In this paper, we propose an extension of the so-called Iri-Imai method to solve constrained convex programming problems. The original Iri-Imai method is designed for linear programs and assumes that the optimal objective value of the optimization problem is known in advance. Zhang [18] extends the method for constrained convex optimization, but the optimum value is still assumed to be known in...

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

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