Smooth methods of multipliers for complementarity problems

DOI10.1007/S101079900076zbMath0978.90094OpenAlexW2044308757MaRDI QIDQ1806025

Michael C. Ferris, Jonathan Eckstein

Publication date: 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.2256

zbMATH Keywords

smoothingcomplementarity problemsaugmented Lagrangiansproximal algorithms

Mathematics Subject Classification ID

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

Related Items (20)

On the Range of the Douglas–Rachford Operator ⋮ Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework ⋮ A regularization smoothing method for second-order cone complementarity problem ⋮ New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems ⋮ Exact penalties for variational inequalities with applications to nonlinear complementarity problems ⋮ A class of Benders decomposition methods for variational inequalities ⋮ Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games ⋮ Attouch-Théra duality revisited: Paramonotonicity and operator splitting ⋮ Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators ⋮ A primal-dual method of partial inverses for composite inclusions ⋮ A generalized proximal-point-based prediction-correction method for variational inequality problems ⋮ Pseudomonotone\(_*\) maps and the cutting plane property ⋮ Weak convergence of an extended splitting method for monotone inclusions ⋮ New multiplier method for solving linear complementarity problems ⋮ Double-regularization proximal methods, with complementarity applications ⋮ Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design ⋮ A regularization smoothing Newton method for solving nonlinear complementarity problem ⋮ A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems ⋮ Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions ⋮ Approximate iterations in Bregman-function-based proximal algorithms

This page was built for publication: Smooth methods of multipliers for complementarity problems