Active set algorithm for mathematical programs with linear complementarity constraints
From MaRDI portal
The authors propose an active set algorithm for mathematical programs with linear complementarity constraints (MPLCC). They prove that any cluster point of the sequence generated by the algorithm is a \(B\)-stationary point of MPLCC provided that the feasible set is bounded and LICQ holds. Numerical results are also presented.
Recommendations
- An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints
- An Implementable Active‐Set Algorithm for Computing a B‐Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum
- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
Cites work
- A numerical approach to optimization problems with variational inequality constraints
- A numerically stable dual method for solving strictly convex quadratic programs
- A smoothing method for mathematical programs with equilibrium constraints
- A tolerant algorithm for linearly constrained optimization calculations
- An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- scientific article; zbMATH DE number 978735 (Why is no real title available?)
- scientific article; zbMATH DE number 1163113 (Why is no real title available?)
- scientific article; zbMATH DE number 1424524 (Why is no real title available?)
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints
- OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Solving mathematical programs with complementarity constraints as nonlinear programs
Cited in
(11)- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
- Hybrid approach with active set identification 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
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- scientific article; zbMATH DE number 4046981 (Why is no real title available?)
- scientific article; zbMATH DE number 4126605 (Why is no real title available?)
- scientific article; zbMATH DE number 6907388 (Why is no real title available?)
- Sequential linearization method for bound-constrained mathematical programs with complementarity constraints
- An Implementable Active‐Set Algorithm for Computing a B‐Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
This page was built for publication: Active set algorithm for mathematical programs with linear complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545973)