Standard

ON MINIMIZING THE SUM OF A CONVEX FUNCTION AND A CONCAVE FUNCTION. / Polyakova, L. N.

In: Mathematical Programming Study, No. 29, 01.05.1986, p. 69-73.

Research output: Contribution to journal › Article › peer-review

Harvard

Polyakova, LN 1986, 'ON MINIMIZING THE SUM OF A CONVEX FUNCTION AND A CONCAVE FUNCTION.', Mathematical Programming Study, no. 29, pp. 69-73.

APA

Polyakova, L. N. (1986). ON MINIMIZING THE SUM OF A CONVEX FUNCTION AND A CONCAVE FUNCTION. Mathematical Programming Study, (29), 69-73.

Vancouver

Polyakova LN. ON MINIMIZING THE SUM OF A CONVEX FUNCTION AND A CONCAVE FUNCTION. Mathematical Programming Study. 1986 May 1;(29):69-73.

Author

Polyakova, L. N. / ON MINIMIZING THE SUM OF A CONVEX FUNCTION AND A CONCAVE FUNCTION. In: Mathematical Programming Study. 1986 ; No. 29. pp. 69-73.

BibTeX

@article{7e833776db8547d29cb2c61d8c39f944,
title = "ON MINIMIZING THE SUM OF A CONVEX FUNCTION AND A CONCAVE FUNCTION.",
abstract = "We consider here the problem of minimizing a particular subclass of quasidifferentiable functions: those which may be represented as the sum of a convex function and a concave function. It is shown that in an n-dimensional space this problem is equivalent to the problem of minimizing a concave function on a convex set. A successive approximations method is suggested; this makes use of some of the principles of epsilon -steepest-descent-type approaches.",
author = "Polyakova, {L. N.}",
year = "1986",
month = may,
day = "1",
language = "English",
pages = "69--73",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer Nature",
number = "29",

}

RIS

TY - JOUR

T1 - ON MINIMIZING THE SUM OF A CONVEX FUNCTION AND A CONCAVE FUNCTION.

AU - Polyakova, L. N.

PY - 1986/5/1

Y1 - 1986/5/1

N2 - We consider here the problem of minimizing a particular subclass of quasidifferentiable functions: those which may be represented as the sum of a convex function and a concave function. It is shown that in an n-dimensional space this problem is equivalent to the problem of minimizing a concave function on a convex set. A successive approximations method is suggested; this makes use of some of the principles of epsilon -steepest-descent-type approaches.

AB - We consider here the problem of minimizing a particular subclass of quasidifferentiable functions: those which may be represented as the sum of a convex function and a concave function. It is shown that in an n-dimensional space this problem is equivalent to the problem of minimizing a concave function on a convex set. A successive approximations method is suggested; this makes use of some of the principles of epsilon -steepest-descent-type approaches.

UR - http://www.scopus.com/inward/record.url?scp=0022717920&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0022717920

SP - 69

EP - 73

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 29

ER -

ID: 36585657