1997
DOI: 10.1287/moor.22.1.43
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming

Abstract: We consider a wide class of penalty and barrier methods for convex programming which includes a number of specific functions proposed in the literature. We provide a systematic way to generate penalty and barrier functions in this class, and we analyze the existence of primal and dual optimal paths generated by these penalty methods, as well as their convergence to the primal and dual optimal sets. For linear programming we prove that these optimal paths converge to single points.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
84
0
1

Year Published

2001
2001
2009
2009

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 111 publications
(87 citation statements)
references
References 7 publications
2
84
0
1
Order By: Relevance
“…Then, since it is nonconstant, θ ∞ (1) > 0. The following result was proved in [3] in a more general setting.…”
Section: Preliminariesmentioning
confidence: 93%
See 2 more Smart Citations
“…Then, since it is nonconstant, θ ∞ (1) > 0. The following result was proved in [3] in a more general setting.…”
Section: Preliminariesmentioning
confidence: 93%
“…This smoothing approach has been also proposed by Polak-Royset-Womersley [20], by Sheu-Wu [27] for finite min-max problems subject to infinitely many linear constraints and, more recently, by Sheu-Lin [26] for continuous min-max problems, motivated by the global approach of Fang-Wu [12] using an integral analog. We must also smooth the function δ D k and to do that we consider the smoothing approach by penalty and barrier functions introduced, for ordinary convex programs, by Auslender-Cominetti-Haddou [3]. These authors exploited the notion of recession functions to provide a wide class of penalty and barrier methods for usual convex programs, with a finite number of inequalities.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…For this extremely simple feasible set, most penalty functions (e.g., those studied in [2]) give the same sets of optimizers, those described by…”
Section: In That Case χ (µ)mentioning
confidence: 99%
“…Let k, m, n ∈ N be fixed, q = n + m. For q = 0, the fact that g 0 k is bounded by 2 on readily implies (47) with K 0 = θ (2). On the other hand g ∞ k is clearly continuous on .…”
Section: An Example Of Class C ∞mentioning
confidence: 99%