A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints.
From MaRDI portal
Publication:5942313
DOI10.1023/A:1011226232107zbMath1049.90125OpenAlexW1832190644MaRDI QIDQ5942313
Guo-shan Liu, Zhang, Jianzhong
Publication date: 28 August 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011226232107
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55) Extreme-point and pivoting methods (90C49)
Related Items (11)
Nonlinear robust optimization via sequential convex bilevel programming ⋮ Lifting mathematical programs with complementarity constraints ⋮ Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs ⋮ Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms ⋮ Globalizing a nonsmooth Newton method via nonmonotone path search ⋮ Some properties of regularization and penalization schemes for MPECs ⋮ Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints ⋮ A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints ⋮ A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints ⋮ Global optimization method for solving mathematical programs with linear complementarity constraints ⋮ Partial exact penalty for mathematical programs with equilibrium constraints
This page was built for publication: A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints.
