A projected-gradient interior-point algorithm for complementarity problems
DOI10.1007/S11075-010-9439-0zbMATH Open1229.65097OpenAlexW1999067864MaRDI QIDQ634730FDOQ634730
Authors: R. Andreani, J. M. Martínez, Joao Patrício, Joaquim J. Júdice 
Publication date: 16 August 2011
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-010-9439-0
Recommendations
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Interfaces to PATH 3.0: Design, implementation and usage
- LOQO:an interior point code for quadratic programming
- Algorithm 813
- CUTEr and SifDec
- Title not available (Why is that?)
- Numerical Optimization
- Title not available (Why is that?)
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Title not available (Why is that?)
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Title not available (Why is that?)
- A collection of test problems for constrained global optimization algorithms
- Title not available (Why is that?)
- Iterative Solution of Nonlinear Equations in Several Variables
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- Feasible descent algorithms for mixed complementarity problems
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
- On the natural merit function for solving complementarity problems
- Inexact spectral projected gradient methods on convex sets
- Stationary points of bound constrained minimization reformulations of complementarity problems
- On the resolution of the generalized nonlinear complementarity problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- Contributions to the theory of the method of steepest descent
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Projective algorithms for solving complementarity problems
- A nonsmooth Levenberg-Marquardt method for vertical complementarity problems
- Fast convergence of an inexact interior point method for horizontal complementarity problems
- Modulus-based matrix splitting methods for a class of horizontal nonlinear complementarity problems
- An inexact Newton algorithm for horizontal complementarity
- Feasibility problems with complementarity constraints
- Title not available (Why is that?)
- Global inexact quasi-Newton method for nonlinear system of equations with constraints
Uses Software
This page was built for publication: A projected-gradient interior-point algorithm for complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634730)
