Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints
From MaRDI portal
Publication:543397
DOI10.1007/s10107-009-0291-8zbMath1218.90183OpenAlexW2072477022MaRDI QIDQ543397
Publication date: 17 June 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0291-8
linear complementarity problemregularization techniqueZ-matrixPerron-Frobenius theoremP\(_{0}\)-matrix
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (8)
A smoothing trust region filter algorithm for nonsmooth least squares problems ⋮ Sparse solutions of linear complementarity problems ⋮ A generalized Newton method for a class of discrete-time linear complementarity systems ⋮ Differential variational inequality approach to dynamic games with shared constraints ⋮ Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities ⋮ Continuous Selections of Solutions to Parametric Variational Inequalities ⋮ Newton iterations in implicit time-stepping scheme for differential linear complementarity systems ⋮ The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
Cites Work
- Unnamed Item
- Unnamed Item
- Non-zenoness of a class of differential quasi-variational inequalities
- Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
- A smoothing method for a mathematical program with P-matrix linear complementarity constraints
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Differential variational inequalities
- Implicit smoothing and its application to optimization with piecewise smooth equality constraints
- Computation of error bounds for P-matrix linear complementarity problems
- AN ENCLOSURE METHOD FOR FREE BOUNDARY PROBLEMS BASED ON A LINEAR COMPLEMENTARITY PROBLEM WITH INTERVAL DATA*
- Perturbation Bounds of P-Matrix Linear Complementarity Problems
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Engineering and Economic Applications of Complementarity Problems
- Optimality Conditions for Optimization Problems with Complementarity Constraints
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- An Implicit Programming Approach for a Class of Stochastic Mathematical Programs with Complementarity Constraints
- Convex Analysis
- A Regularized Sample Average Approximation Method for Stochastic Mathematical Programs with Nonsmooth Equality Constraints
This page was built for publication: Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints
