A global QP-free algorithm for mathematical programs with complementarity constraints

A global QP-free algorithm for mathematical programs with complementarity constraints

Abstract In this paper, a primal–dual interior point QP-free algorithm for mathematical programs with complementarity constraints is presented. Firstly, based on Fischer–Burmeister function and smoothing techniques, the investigated problem is approximated by a smooth nonlinear constrained optimizat...

Full description

Bibliographic Details
Main Authors: Jian Ling Li, Qi Zhang
Format: Article
Language:English
Published: SpringerOpen 2020-08-01
Series:Journal of Inequalities and Applications
Subjects:
Complementarity constraints
Working set
QP-free algorithm
Global convergence
Online Access:http://link.springer.com/article/10.1186/s13660-020-02479-6

Internet

http://link.springer.com/article/10.1186/s13660-020-02479-6

Similar Items