Modified Courant-Beltrami penalty function and a duality gap for invex optimization problem

نویسندگان
چکیده

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

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

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

منابع مشابه

The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems

The exactness of the penalization for the exact l1 penalty function method used for solving nonsmooth constrained optimization problems with both inequality and equality constraints are presented. Thus, the equivalence between the sets of optimal solutions in the nonsmooth constrained optimization problem and its associated penalized optimization problem with the exact l1 penalty function is es...

متن کامل

An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem

A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...

متن کامل

An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem

A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...

متن کامل

Eliminating Duality Gap by α Penalty

In this short and self contained paper we are proposing a simple penalty, which is a modification on the constraint set. We show that duality gap is eliminated under certain conditions.

متن کامل

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions

for Invex Programs via Penalty Functions J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing 400065, China X. X. Huang School of Management, Fudan University, Shanghai 200433, China Abstract. In this paper, we apply the quadratic penalization technique to derive strong Lagrangian duality property for an inequality constrained invex program....

متن کامل

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


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

ژورنال

عنوان ژورنال: International Journal for Simulation and Multidisciplinary Design Optimization

سال: 2019

ISSN: 1779-6288

DOI: 10.1051/smdo/2019010