A smoothing method for a mathematical program with P-matrix linear complementarity constraints
From MaRDI portal
Publication:1430271
DOI10.1023/B:COAP.0000013057.54647.6dzbMath1046.90086OpenAlexW2090770774MaRDI QIDQ1430271
Publication date: 27 May 2004
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:coap.0000013057.54647.6d
mathematical program with equilibrium constraintssmoothing approximationreformulationP-matrix linear complementarity problem
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints ⋮ The subdifferential of measurable composite max integrands and smoothing approximation ⋮ New relaxation method for mathematical programs with complementarity constraints ⋮ Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC ⋮ Solving bilevel programs with the KKT-approach ⋮ A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem ⋮ A majorized penalty approach to inverse linear second order cone programming problems ⋮ Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints ⋮ On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints ⋮ A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities ⋮ Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization ⋮ A non-interior-point smoothing method for variational inequality problem ⋮ Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints ⋮ A modified relaxation scheme for mathematical programs with complementarity constraints ⋮ Smoothing methods for nonsmooth, nonconvex minimization ⋮ Hybrid approach with active set identification for mathematical programs with complementarity constraints ⋮ Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints ⋮ A perturbation approach for an inverse quadratic programming problem over second-order cones ⋮ A new homotopy method for solving non-linear complementarity problems
This page was built for publication: A smoothing method for a mathematical program with P-matrix linear complementarity constraints
