On A characterization of optimality in convex programming

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1976 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 11, pages 81-88 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: Adi Ben-Israel; Aharon Ben-Tal;

doi: 10.1007/bf01580372

On A characterization of optimality in convex programming

- Summary
- Subjects
- Metrics

Abstract

Necessary and sufficient conditions for optimality are given, for convex programming problems, without constraint qualification, in terms of a single mathematical program, which can be chosen to be bilinear.

Related Organizations

Technion – Israel Institute of Technology
Israel
University of Delaware
United States

Keywords

Convex programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	8
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average