On the natural merit function for solving complementarity problems
From MaRDI portal
Publication:647391
DOI10.1007/s10107-009-0336-zzbMath1236.90127OpenAlexW1992881505MaRDI QIDQ647391
Publication date: 23 November 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-0336-z
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Fast convergence of an inexact interior point method for horizontal complementarity problems ⋮ Feasibility problems with complementarity constraints ⋮ A projected-gradient interior-point algorithm for complementarity problems ⋮ Global inexact quasi-Newton method for nonlinear system of equations with constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A simply constrained optimization reformulation of KKT systems arising from variational inequalities
- Nonlinear complementarity as unconstrained and constrained minimization
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Stationary points of bound constrained minimization reformulations of complementarity problems
- Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
- An adaptive simulated annealing algorithm for global optimization over continuous variables
- Superlinear primal-dual affine scaling algorithms for LCP
- Feasible descent algorithms for mixed complementarity problems
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- On the Resolution of the Generalized Nonlinear Complementarity Problem
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
- Regularity Properties of a Semismooth Reformulation of Variational Inequalities
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- Inexact spectral projected gradient methods on convex sets
- Reformulation of Variational Inequalities on a Simplex and Compactification of Complementarity Problems
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Global Methods for Nonlinear Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A new strategy for solving variational inequalities in bounded polytopes∗
- Yury G. Evtushenko – a tribute
- Algorithm 813
- A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions
- Sensitivity Analysis of Parameterized Variational Inequalities
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
