Perfect duality for convexlike programs

M. Hayashi; H. Komiya

doi:10.1007/BF00934081

Perfect duality for convexlike programs

M. Hayashi, H. Komiya

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

51 Citations (Scopus)

Abstract

The minimizing problem for a convex program has a dual problem, that is, the maximizing problem of the Lagrangian. Although these problems have a duality gap in general, the duality gap can be eliminated by relaxing the constraint of the minimizing problem, so that the constraint is enforced only in the limit. We extend this result to the convexlike case. Moreover, we obtain a necessary condition for optimality for minimizing problems whose objective function and constraint mapping have convex Gateaux derivative.

Original language	English
Pages (from-to)	179-189
Number of pages	11
Journal	Journal of Optimization Theory and Applications
Volume	38
Issue number	2
DOIs	https://doi.org/10.1007/BF00934081
Publication status	Published - 1982 Oct 1
Externally published	Yes

Keywords

Convexlike programs
Lagrangian function
necessary condition for optimality
perfect duality

ASJC Scopus subject areas

Control and Optimization
Management Science and Operations Research
Applied Mathematics

Access to Document

10.1007/BF00934081

Fingerprint Dive into the research topics of 'Perfect duality for convexlike programs'. Together they form a unique fingerprint.

Cite this

@article{ef7e43adae004acb9781c46fd404dba6,

title = "Perfect duality for convexlike programs",

abstract = "The minimizing problem for a convex program has a dual problem, that is, the maximizing problem of the Lagrangian. Although these problems have a duality gap in general, the duality gap can be eliminated by relaxing the constraint of the minimizing problem, so that the constraint is enforced only in the limit. We extend this result to the convexlike case. Moreover, we obtain a necessary condition for optimality for minimizing problems whose objective function and constraint mapping have convex Gateaux derivative.",

keywords = "Convexlike programs, Lagrangian function, necessary condition for optimality, perfect duality",

author = "M. Hayashi and H. Komiya",

year = "1982",

month = oct,

day = "1",

doi = "10.1007/BF00934081",

language = "English",

volume = "38",

pages = "179--189",

journal = "Journal of Optimization Theory and Applications",

issn = "0022-3239",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Perfect duality for convexlike programs

AU - Hayashi, M.

AU - Komiya, H.

PY - 1982/10/1

Y1 - 1982/10/1

N2 - The minimizing problem for a convex program has a dual problem, that is, the maximizing problem of the Lagrangian. Although these problems have a duality gap in general, the duality gap can be eliminated by relaxing the constraint of the minimizing problem, so that the constraint is enforced only in the limit. We extend this result to the convexlike case. Moreover, we obtain a necessary condition for optimality for minimizing problems whose objective function and constraint mapping have convex Gateaux derivative.

AB - The minimizing problem for a convex program has a dual problem, that is, the maximizing problem of the Lagrangian. Although these problems have a duality gap in general, the duality gap can be eliminated by relaxing the constraint of the minimizing problem, so that the constraint is enforced only in the limit. We extend this result to the convexlike case. Moreover, we obtain a necessary condition for optimality for minimizing problems whose objective function and constraint mapping have convex Gateaux derivative.

KW - Convexlike programs

KW - Lagrangian function

KW - necessary condition for optimality

KW - perfect duality

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

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

U2 - 10.1007/BF00934081

DO - 10.1007/BF00934081

M3 - Article

AN - SCOPUS:0020193048

VL - 38

SP - 179

EP - 189

JO - Journal of Optimization Theory and Applications

JF - Journal of Optimization Theory and Applications

SN - 0022-3239

IS - 2

ER -

Perfect duality for convexlike programs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this