On the natural merit function for solving complementarity problems
From MaRDI portal
Publication:647391
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.
Recommendations
- scientific article; zbMATH DE number 1076336
- On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems
- scientific article; zbMATH DE number 1059228
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- On the resolution of monotone complementarity problems
Cites work
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A new strategy for solving variational inequalities in bounded polytopes∗
- A simply constrained optimization reformulation of KKT systems arising from variational inequalities
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Algorithm 813
- An adaptive simulated annealing algorithm for global optimization over continuous variables
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Feasible descent algorithms for mixed complementarity problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Global Methods for Nonlinear Complementarity Problems
- scientific article; zbMATH DE number 1819688 (Why is no real title available?)
- scientific article; zbMATH DE number 41947 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 1059220 (Why is no real title available?)
- Inexact spectral projected gradient methods on convex sets
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Nonlinear complementarity as unconstrained and constrained minimization
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the resolution of the generalized nonlinear complementarity problem
- Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
- Reformulation of Variational Inequalities on a Simplex and Compactification of Complementarity Problems
- Regularity Properties of a Semismooth Reformulation of Variational Inequalities
- Sensitivity Analysis of Parameterized Variational Inequalities
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
- Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
- Stationary points of bound constrained minimization reformulations of complementarity problems
- Superlinear primal-dual affine scaling algorithms for LCP
- Yury G. Evtushenko – a tribute
Cited in
(6)- Fast convergence of an inexact interior point method for horizontal complementarity problems
- Merit functions for complementarity and related problems: a survey
- Global inexact quasi-Newton method for nonlinear system of equations with constraints
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- Feasibility problems with complementarity constraints
- A projected-gradient interior-point algorithm for complementarity problems
This page was built for publication: On the natural merit function for solving complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647391)
