Equivalence of the generalized complementarity problem to differentiable unconstrained minimization

被引:69
|
作者
Kanzow, C [1 ]
Fukushima, M [1 ]
机构
[1] KYOTO UNIV,GRAD SCH ENGN,DEPT APPL MATH & PHYS,KYOTO,JAPAN
关键词
generalized complementarity problem; nonlinear complementarity problem; unconstrained minimization; stationary point; bounded level set; global error bound;
D O I
10.1007/BF02189797
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider an unconstrained minimization reformulation of the generalized complementarity problem (GCP). The merit function introduced here is differentiable and has the property that its global minimizers coincide with the solutions of GCP. Conditions for its stationary points to be global minimizers are given. Moreover, it is shown that the level sets of the merit function are bounded under suitable assumptions. We also show that the merit function provides global error bounds for GCP. These results are based on a condition which reduces to the condition of the uniform P-function when GCP is specialized to the nonlinear complementarity problem. This condition also turns out to be useful in proving the existence and uniqueness of a solution for GCP itself. Finally, we obtain as a byproduct an error bound result with the natural residual for GCP.
引用
收藏
页码:581 / 603
页数:23
相关论文
共 50 条
  • [31] The generalized linear complementarity problem revisited
    Mohan, SR
    Neogy, SK
    Sridhar, R
    MATHEMATICAL PROGRAMMING, 1996, 74 (02) : 197 - 218
  • [32] On the resolution of the generalized nonlinear complementarity problem
    Andreani, R
    Friedlander, A
    Santos, SA
    SIAM JOURNAL ON OPTIMIZATION, 2001, 12 (02) : 303 - 321
  • [33] A new generalized linear complementarity problem
    Wang, Chao
    Jiang, Cui-Ting
    PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE OF MATRICES AND OPERATORS (MAO 2012), 2012, : 186 - 189
  • [34] SOLUTION OF THE PROBLEM OF MINIMIZATION OF THE NUMBER OF EQUIVALENCE CLASSES
    BERKOVICH, MM
    KLEYMAN, AS
    YARKIN, YV
    ENGINEERING CYBERNETICS, 1981, 19 (03): : 18 - 24
  • [35] Equivalence between different formulations of the linear complementarity problem
    Anitescu, M
    Lesaja, G
    Potra, FA
    OPTIMIZATION METHODS & SOFTWARE, 1997, 7 (3-4): : 265 - 290
  • [36] Exact 1-norm support vector machines via unconstrained convex differentiable minimization
    Mangasarian, Olvi L.
    JOURNAL OF MACHINE LEARNING RESEARCH, 2006, 7 : 1517 - 1530
  • [37] Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem
    Halima Lakhbab
    Souad El Bernoussi
    Computational and Applied Mathematics, 2017, 36 : 1421 - 1430
  • [38] Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem
    Lakhbab, Halima
    El Bernoussi, Souad
    COMPUTATIONAL & APPLIED MATHEMATICS, 2017, 36 (03): : 1421 - 1430
  • [39] GLOBAL CONVERGENCE OF UNCONSTRAINED MINIMIZATION METHODS WITH A GENERALIZED BACKTRACKING LINESEARCH PROCEDURE
    LIU Guanghui
    HAN Jiye(Institute of Applied Mathematics
    SystemsScienceandMathematicalSciences, 1995, (02) : 122 - 127
  • [40] Equivalence of generalized mixed complementarity and generalized mixed least element problems in ordered spaces
    Zeng, Lu-Chuan
    Ansari, Qamrul Hasan
    Yao, Jen-Chih
    OPTIMIZATION, 2009, 58 (01) : 63 - 76