RECURRENCE FORMULAE ON CONE EXTREME POINTS AND THEIR APPLICATIONS TO DYNAMIC PROGRAMMING

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modern Computational Applications of Dynamic Programming

Computational dynamic programming, while of some use for situations typically encountered in industrial and systems engineering, has proved to be of much greater significance in many areas of computer science. We review some of these applications here.

متن کامل

Extreme Programming for Mobile Applications

The liberty, expediency, and flexibility that come with mobile access have led to proliferation of mobile applications. At the same time, these applications face constant challenges posed by new implementation languages, variations in user agents, and demands for new services from user classes of different cultural backgrounds, age groups, and capabilities. To address that, we require a methodi...

متن کامل

Extreme Values and Their Applications in Finance

Extreme price movements in the financial markets are rare, but important. The stock market crash on Wall Street in October 1987 and other big financial crises such as the Long Term Capital Management and the bankruptcy of Lehman Brothers have attracted a great deal of attention among investors, practitioners and researchers. The recent worldwide financial crisis characterized by the substantial...

متن کامل

Applications of Second Order Cone Programming

A significant special case of the problems which could be solved were those whose constraints were given by semidefinite cones. A Semidefinite Program (SDP) is an optimisation over the intersection of an affine set and cone of positive semidefinite matrices (Alizadeh and Goldfarb, 2001). Cone programming is discussed more in Section 3. Within semidefinite programming there is a smaller set of p...

متن کامل

Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming

The paper is devoted to the study of general nonsmooth problems of cone-constrained optimization (or conic programming) important for various aspects of optimization theory and applications. Based on advanced constructions and techniques of variational analysis and generalized differentiation, we derive new necessary optimality conditions (in both " exact " and " fuzzy " forms) for nonsmooth co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics

سال: 1979

ISSN: 0373-6385

DOI: 10.2206/kyushumfs.33.283