A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints

DOI10.1007/s00211-004-0542-9zbMath1062.65067OpenAlexW2067487640MaRDI QIDQ704808

Zhang, Jianzhong, Guo-shan Liu, Shou-Yang Wang

Publication date: 19 January 2005

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-004-0542-9

zbMATH Keywords

algorithmglobal convergencenumerical resultslinear complementarity problemscomplementarity constraintsnondegeneracy condition

Mathematics Subject Classification ID

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

Related Items (2)

Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints ⋮ Partial exact penalty for mathematical programs with equilibrium constraints

Uses Software

• OPECgen

Cites Work

• Unnamed Item
• Unnamed Item
• Introduction to sensitivity and stability analysis in nonlinear programming
• Existence of optimal solutions to mathematical programs with equilibrium constraints
• Hierarchical optimization: An introduction
• OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
• Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
• A smoothing method for mathematical programs with equilibrium constraints
• Descent approaches for quadratic bilevel programming
• Bilevel and multilevel programming: A bibliography review
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• A numerical approach to optimization problems with variational inequality constraints
• Exact and inexact penalty methods for the generalized bilevel programming problem
• On bilevel programming. I: General nonlinear cases
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
• Exact Penalization of Mathematical Programs with Equilibrium Constraints
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints.

This page was built for publication: A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints