A projected-gradient interior-point algorithm for complementarity problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1819688 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 41947 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3624709 (Why is no real title available?)
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- A collection of test problems for constrained global optimization algorithms
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Algorithm 813
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- CUTEr and SifDec
- Contributions to the theory of the method of steepest descent
- Feasible descent algorithms for mixed complementarity problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Inexact spectral projected gradient methods on convex sets
- Interfaces to PATH 3.0: Design, implementation and usage
- Iterative Solution of Nonlinear Equations in Several Variables
- LOQO:an interior point code for quadratic programming
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Numerical Optimization
- On the natural merit function for solving complementarity problems
- On the resolution of the generalized nonlinear complementarity problem
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
- Stationary points of bound constrained minimization reformulations of complementarity problems
Cited in
(9)- Projective algorithms for solving complementarity problems
- scientific article; zbMATH DE number 776080 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2068029 (Why is no real title available?)
- Global inexact quasi-Newton method for nonlinear system of equations with constraints
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)
