A smoothing method for a mathematical program with P-matrix linear complementarity constraints

DOI10.1023/B:COAP.0000013057.54647.6DMaRDI QIDQ1430271zbMATH OpenOpenAlexFDO

Authors Xiaojun Chen, Masao Fukushima

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

zbMATH Keywords

mathematical program with equilibrium constraintsP-matrix linear complementarity problemreformulationsmoothing approximation

Mathematics Subject Classification ID

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

Recommendations

• A smoothing method for mathematical programs with complementarity constraints
• A new smoothing scheme for mathematical programs with complementarity constraints
• A new smoothing method for mathematical programs with complementarity constraints
• A class of smoothing methods for mathematical programs with complementarity constraints
• Smoothing method for mathematical programs with symmetric cone complementarity constraints

Cited in

(26)

• Improved smoothing-type methods for the solution of linear programs
• New relaxation method for mathematical programs with complementarity constraints
• On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints
• A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function
• A modified relaxation scheme for mathematical programs with complementarity constraints
• Solving bilevel programs with the KKT-approach
• The subdifferential of measurable composite max integrands and smoothing approximation
• A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
• A majorized penalty approach to inverse linear second order cone programming problems
• Hybrid approach with active set identification for mathematical programs with complementarity constraints
• Analysis on the smoothing method for the \(P\)-linear complementarity systems
• A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem
• Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints
• Improved convergence properties of the relaxation schemes of Kadrani et al. and Kanzow and Schwartz for MPEC
• Implicit solution function of P\(_{0}\) and Z matrix linear 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
• A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities
• Approximation methods for a class of non-Lipschitz mathematical programs with equilibrium constraints
• A method for multi-leader-multi-follower games by smoothing the followers' response function
• Supply chain network equilibrium with outsourcing for fresh agricultural products under stochastic demands
• Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints
• Smoothing methods for nonsmooth, nonconvex minimization
• Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints
• 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

This page was built for publication: A smoothing method for a mathematical program with P-matrix linear complementarity constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1430271)