✦ LIBER ✦

Convex programs with an additional constraint on the product of several convex functions

✍ Scribed by Takahito Kuno; Yasutoshi Yajima; Yoshitsugu Yamamoto; Hiroshi Konno

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 616 KB
Volume: 77
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90375-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Parallel Algorithm for Linear Programs

A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint

✍ Shih-Mim Liu; G.P. Papavassilopoulos 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 211 KB

A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (≤n) processors are used for a problem with n variables and a globally optimal solution is fo

A theorem on the additivity of the quasi

A theorem on the additivity of the quasi-concave closure of an additive convex function

✍ Uzi Segal 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 254 KB

An upper bound on the expected value of

An upper bound on the expected value of a non-increasing convex function with convex marginal return functions

✍ Christopher J. Donohue; John R. Birge 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 441 KB

The application of the method of Fejer a

The application of the method of Fejer approximations to the solution of problems of convex programming with non-smooth constraints

✍ I.I. Eremin 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 520 KB

OPTIMIZATION OF MECHANICAL SYSTEMS: ON N

OPTIMIZATION OF MECHANICAL SYSTEMS: ON NON-LINEAR FIRST-ORDER APPROXIMATION WITH AN ADDITIVE CONVEX TERM

✍ KEGL, M. ;OBLAK, M. M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB 👁 2 views

This paper presents an improved approximation technique for gradient based approximation methods of mathematical programming. The proposed technique prevents oscillations of the sequence of approximate solutions in the optimization process eciently and preserves the relatively simple form of the app

On the breakdown point of M-estimators w

On the breakdown point of M-estimators with the convex object functions: AAns 32/4 (1991)429–435

✍ Jia Pei-zhang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 67 KB