CONVEX FUNCTIONS WITH UNBOUNDED LEVEL SETS AND APPLICATIONS TO DUALITY THEORY

被引:40
作者
Auslender, A. [1 ]
Cominetti, R. [2 ]
Crouzeix, J. -P. [1 ]
机构
[1] Univ Blaise Pascal, Dept Appl Math, F-63177 Aubiere, France
[2] Univ Chile, Santiago, Chile
关键词
convex optimization; duality; inf-compactness; good asymptotic behavior; relaxed constraint qualification; algorithms;
D O I
10.1137/0803034
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A class of convex functions with unbounded level sets but good behavior at infinity [Analyse non-lingaire, Gauthier-Villars, Paris, 1989, pp. 101-122] is investigated. Characterizations and properties are given. The results are then applied to studying sequential approximation schemes for optimization problems and to duality theory, when the involved functions have unbounded level sets. In particular, the convergence properties of stationary sequences for the dual of a convex program are studied, and methods for associating with it a primal sequence converging to a solution of the primal problem are demonstrated.
引用
收藏
页码:669 / 687
页数:19
相关论文
共 7 条
[1]   ASYMPTOTIC PROPERTIES OF THE FENCHEL DUAL FUNCTIONAL AND APPLICATIONS TO DECOMPOSITION PROBLEMS [J].
AUSLENDER, A .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1992, 73 (03) :427-499
[2]  
AUSLENDER A., 1989, ANAL NONLINEAIRE, P101
[3]  
CENSOR Y., 1987, SIAM J CONTROL OPTIM, V25, P921
[4]   OPTIMAL VALUE FUNCTION IN SEMI-INFINITE PROGRAMMING [J].
GOBERNA, MA ;
LOPEZ, MA .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1988, 59 (02) :261-279
[5]   A PARALLEL ALGORITHM FOR A CLASS OF CONVEX-PROGRAMS [J].
HAN, SP ;
LOU, G .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1988, 26 (02) :345-355
[6]  
Rockafellar R., 1968, CONVEX ANAL
[7]   RELAXATION METHODS FOR PROBLEMS WITH STRICTLY CONVEX SEPARABLE COSTS AND LINEAR CONSTRAINTS [J].
TSENG, P ;
BERTSEKAS, DP .
MATHEMATICAL PROGRAMMING, 1987, 38 (03) :303-321