An effective logarithmic formulation for piecewise linearization requiring no inequality constraint

نویسندگان

چکیده

One of the commonly used techniques for tackling nonconvex optimization problems in which all nonlinear terms are univariate is piecewise linear approximation by reformulated. The performance linearization technique primarily depends on quantities variables and constraints required formulation a function. state-of-the-art method introduces $$2\lceil \log _2 m\rceil$$ inequality constraints, where m number line segments constructed This study proposes an effective alternative logarithmic scheme no constraint incurred. price that more continuous needed proposed than less offset simultaneous inclusion system equality satisfying canonical form absence any constraint. Our numerical experiments demonstrate developed has computational superiority, degree increases with m.

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

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

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

منابع مشابه

An isoperimetric inequality for logarithmic capacity

We prove a sharp lower bound of the form capE ≥ (1/2)diamE · Ψ(areaE/((π/4)diam 2E)) for the logarithmic capacity of a compact connected planar set E in terms of its area and diameter. Our lower bound includes as special cases G. Faber’s inequality capE ≥ diamE/4 and G. Pólya’s inequality capE ≥ (areaE/π)1/2. We give explicit formulations, functions of (1/2)diamE, for the extremal domains which...

متن کامل

An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint

We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and twosided bounds on the variables (box constraints). Such problems are interesting from both theoretical and practical point of view because they arise in somemathematical programming problems as well as in various practical prob...

متن کامل

An isoperimetric inequality for logarithmic capacity of polygons

We verify an old conjecture of G. Pólya and G. Szegő saying that the regular n-gon minimizes the logarithmic capacity among all n-gons with a fixed area.

متن کامل

Logarithmic Sobolev inequality revisited

r é s u m é Nous donnons une nouvelle caractérisation de l’inégalité de Sobolev logarithmique. © 2017 Académie des sciences. Published by Elsevier Masson SAS. All rights reserved.

متن کامل

Logarithmic Sobolev Trace Inequality

A logarithmic Sobolev trace inequality is derived. Bounds on the best constant for this inequality from above and below are investigated using the sharp Sobolev inequality and the sharp logarithmic Sobolev inequality. Logarithmic Sobolev inequalities capture the spirit of classical Sobolev inequalities with the logarithm function replacing powers, and they can be considered as limiting cases of...

متن کامل

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


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

ژورنال

عنوان ژورنال: Computational Optimization and Applications

سال: 2021

ISSN: ['0926-6003', '1573-2894']

DOI: https://doi.org/10.1007/s10589-021-00285-4