Approximate optimal solutions and nonlinear Lagrangian functions

被引:9
作者
Huang, XX [2 ]
Yang, XQ
机构
[1] Chongqing Normal Univ, Dept Math & Comp Sci, Chongqing 400047, Peoples R China
[2] Hong Kong Polytech Univ, Dept Appl Math, Kowloon, Hong Kong, Peoples R China
基金
澳大利亚研究理事会;
关键词
nonlinear programming; approximate solution; nonlinear Lagrangian; Ekeland's variational principle;
D O I
10.1023/A:1017960629124
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
There is an increasing interest in the study of optimality conditions of approximate solutions for nonlinear optimization problems. In this paper, relationships between approximate optimal values and approximate roots of a nonlinear function are explored via a nonlinear Lagrangian function. Almost approximate optimal solutions are investigated by means of nonlinear Lagrangian functions.
引用
收藏
页码:51 / 65
页数:15
相关论文
共 20 条
[11]   PENALTY-FUNCTIONS IN EPSILON-PROGRAMMING AND EPSILON-MINIMAX PROBLEMS [J].
LORIDAN, P ;
MORGAN, J .
MATHEMATICAL PROGRAMMING, 1983, 26 (02) :213-231
[12]  
Rockafellar R.T., 1998, VARIATIONAL ANAL
[13]  
Rubin GM, 1999, MOL BIOL CELL, V10, p1A
[14]  
RUBINOV AM, PROGR OPTIMIZATION C
[15]  
Rubinov AM., 1999, Optimization, V46, P327, DOI [10.1080/02331939908844460, DOI 10.1080/02331939908844460]
[16]   EPSILON-OPTIMAL SOLUTIONS IN NONDIFFERENTIABLE CONVEX-PROGRAMMING AND SOME RELATED QUESTIONS [J].
STRODIOT, JJ ;
NGUYEN, VH ;
HEUKEMES, N .
MATHEMATICAL PROGRAMMING, 1983, 25 (03) :307-328
[17]   Successive optimization method via parametric monotone composition formulation [J].
Yang, XQ ;
Li, D .
JOURNAL OF GLOBAL OPTIMIZATION, 2000, 16 (04) :355-369
[18]  
YANG XQ, IN PRESS SIAM J OPTI
[19]   EPSILON-OPTIMALITY CRITERIA FOR CONVEX-PROGRAMMING PROBLEMS VIA EXACT PENALTY-FUNCTIONS [J].
YOKOYAMA, K .
MATHEMATICAL PROGRAMMING, 1992, 56 (02) :233-243
[20]   EPSILON-OPTIMALITY CRITERIA FOR VECTOR MINIMIZATION PROBLEMS VIA EXACT PENALTY-FUNCTIONS [J].
YOKOYAMA, K .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1994, 187 (01) :296-305