On the natural merit function for solving complementarity problems
type: Item
instance of: scholarly article
title: On the natural merit function for solving complementarity problems
zbMATH Open document ID: 1236.90127
author: Juan-Miguel Gracia
published in: Mathematical Programming. Series A. Series B
publication date: 2011-11-23T00:00:00Z
review text: The authors consider a general class of complementarity problems (CP's) of the form \[ H(x,y,w)=0, x^{T}w=0, x,w \geq 0, \] containing the usual CP's and investigate the problem of minimization of the natural merit function, which is the sum of squares of the gap components. They give conditions which provide for the stationary points of this problem to be solutions of the initial one. These conditions utilize non-singularity of the Jacobian or monotonicity type properties.
reviewed by: Igor V. Konnov
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5977604
zbMATH Keywords: complementarity problems
zbMATH Keywords: natural merit function
zbMATH Keywords: stationary points
zbMATH Keywords: optimality conditions
describes a project that uses: SPG
MaRDI profile type: Publication
full work available at URL: s10107-009-0336-z
OpenAlex ID: W1992881505
cites work: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
cites work: Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
cites work: On the resolution of the generalized nonlinear complementarity problem
cites work: Reformulation of Variational Inequalities on a Simplex and Compactification of Complementarity Problems
cites work: Yury G. Evtushenko – a tribute
cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
cites work: Algorithm 813
cites work: Inexact spectral projected gradient methods on convex sets
cites work: Q4003375
cites work: A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions
cites work: Q4353534
cites work: Regularity Properties of a Semismooth Reformulation of Variational Inequalities
cites work: A simply constrained optimization reformulation of KKT systems arising from variational inequalities
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
cites work: Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
cites work: Q3152455
cites work: Feasible descent algorithms for mixed complementarity problems
cites work: An adaptive simulated annealing algorithm for global optimization over continuous variables
cites work: A new strategy for solving variational inequalities in bounded polytopes∗
cites work: Q3994823
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: Nonlinear complementarity as unconstrained and constrained minimization
cites work: Local convergence of interior-point algorithms for degenerate monotone LCP
cites work: Superlinear primal-dual affine scaling algorithms for LCP
cites work: Global Methods for Nonlinear Complementarity Problems
cites work: Q4039868
cites work: Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
cites work: Sensitivity Analysis of Parameterized Variational Inequalities
cites work: An Infeasible-Interior-Point Method for Linear Complementarity Problems
cites work: Stationary points of bound constrained minimization reformulations of complementarity problems
cites work: A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
DOI: 10.1007/S10107-009-0336-Z
description: scientific article; zbMATH DE number 5977604