A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
type: Item
instance of: scholarly article
title: A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
zbMATH Open document ID: 1062.65067
published in: Numerische Mathematik
publication date: 2005-01-19T00:00:00Z
review text: A new algorithm is proposed for solving mathematical programs with linear complementarity problems. The advantage of the new algorithm is that it is globally convergent without requiring strong assumptions such as nondegeneracy or linear independence condition. Numerical results show the effectiveness of the algorithm. The proofs of the results are nice pieces of fine analysis. The features of the paper constitute a valuable tool for researchers.
reviewed by: Akrur Behera
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 2130179
zbMATH Keywords: complementarity constraints
zbMATH Keywords: nondegeneracy condition
zbMATH Keywords: global convergence
zbMATH Keywords: algorithm
zbMATH Keywords: linear complementarity problems
zbMATH Keywords: numerical results
author: Jianzhong Zhang
author: Guoshan Liu
author: Shouyang Wang
describes a project that uses: OPECgen
MaRDI profile type: Publication
full work available at URL: s00211-004-0542-9
OpenAlex ID: W2067487640
cites work: Existence of optimal solutions to mathematical programs with equilibrium constraints
cites work: Q4257417
cites work: A smoothing method for mathematical programs with equilibrium constraints
cites work: On bilevel programming. I: General nonlinear cases
cites work: A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
cites work: A numerical approach to optimization problems with variational inequality constraints
cites work: Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
cites work: Q4215008
cites work: Exact Penalization of Mathematical Programs with Equilibrium Constraints
cites work: Descent approaches for quadratic bilevel programming
cites work: A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints.
cites work: Exact and inexact penalty methods for the generalized bilevel programming problem
cites work: Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
cites work: Hierarchical optimization: An introduction
cites work: Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
cites work: Bilevel and multilevel programming: A bibliography review
cites work: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
cites work: An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints
cites work: OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
cites work: Introduction to sensitivity and stability analysis in nonlinear programming
DOI: 10.1007/S00211-004-0542-9
Recommended article: A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints
Recommended article: A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
Recommended article: Q3404694
Recommended article: Global optimization method for solving mathematical programs with linear complementarity constraints
Recommended article: Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
Recommended article: Active set algorithm for mathematical programs with linear complementarity constraints
Recommended article: Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
Recommended article: A globally convergent algorithm for nonlinearly constrained optimization problems
Recommended article: On the Global Solution of Linear Programs with Linear Complementarity Constraints
Recommended article: An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
description: scientific article; zbMATH DE number 2130179