Application of the penalty function method to generalized convex programs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

On generalized Hermite-Hadamard inequality for generalized convex function

In this paper, a new inequality for generalized convex functions which is related to the left side of generalized Hermite-Hadamard type inequality is obtained. Some applications for some generalized special means are also given.

متن کامل

Convex Pricing by a Generalized Entropy Penalty

In an incomplete Brownian-motion market setting, we propose a convex monotonic pricing functional for nonattainable bounded contingent claims which is compatible with prices for attainable claims. The pricing functional is defined as the convex conjugate of a generalized entropy penalty functional and an interpretation in terms of tracking with instantaneously vanishing risk can be given. 1. In...

متن کامل

Path following in the exact penalty method of convex programming

Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, ...

متن کامل

APPLICATION OF EXP-FUNCTION METHOD TO THE (2+1)-DIMENSIONAL CALOGERO BOGOYAVLANSKII SCHIFF EQUATION

In this paper, the Exp-function method, with the aid of a symbolic computation system such as Maple, is applied to the (2+1) -dimensional Calogero Bogoyavlanskii Schiff equation. Exact and explicit generalized solitary solutions are obtained in more general forms. The free parameters can be determined by initial or boundary conditions. The method is straightforward and concise, and its applicat...

متن کامل

An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter

Global convergence in constrained optimization algorithms has traditionally been enforced by the use of parametrized penalty functions. Recently, the filter strategy has been introduced as an alternative. At least part of the motivation for filter methods consists in avoiding the need for estimating a suitable penalty parameter, which is often a delicate task. In this paper, we demonstrate that...

متن کامل

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


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

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2007

ISSN: 0893-9659

DOI: 10.1016/j.aml.2006.05.017