A global convergent inexact successive approximation method for mix complementarity problems

MaRDI QIDQ2739015zbMATH OpenFDO

Authors Guihua He, Changfeng Ma

Publication date 25 February 2002

Published in Journal of Changsha University of Electric Power. Natural Science (Search for Journal in Brave)

zbMATH Keywords

algorithmglobal convergence.inexact successive approximation methodmix complementary problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Review text

The authors present an inexact successive approximation algorithm for mix complementary problems based on its equivalent non-smooth equations. The global convergence of the algorithm is established under suitable conditions.

Recommendations

• A globally convergent inexact successive approximation method for nonlinear complementarity problems
• scientific article; zbMATH DE number 2104604
• scientific article; zbMATH DE number 2068029
• Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
• scientific article; zbMATH DE number 4113873
• Global optimization techniques for mixed complementarity problems
• Lagrangian globalization method for mixed complementarity problems
• OPTIMIZATION BASED GLOBALLY CONVERGENT METHODS FOR THE NONLINEAR COMPLEMENTARITY PROBLEM
• scientific article; zbMATH DE number 5041529
• Convergence of an inexact majorization-minimization method for solving a class of composite optimization problems

Cited in

(1)

• A globally convergent inexact successive approximation method for nonlinear complementarity problems

This page was built for publication: A global convergent inexact successive approximation method for mix complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2739015)