The eigenvalue complementarity problem

DOI10.1007/S10589-007-9017-0zbMath1181.90261OpenAlexW2053678650MaRDI QIDQ2643627

Hanif D. Sherali, Joaquim Joao Júdice, Isabel Martins Ribeiro

Publication date: 27 August 2007

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/7723

zbMATH Keywords

Global optimizationComplementarityEigenvalue problems

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (47)

Higher-degree eigenvalue complementarity problems for tensors ⋮ Stability analysis of rough surfaces in adhesive normal contact ⋮ On the numerical solution of the quadratic eigenvalue complementarity problem ⋮ A semismooth Newton method for tensor eigenvalue complementarity problem ⋮ On the quadratic eigenvalue complementarity problem ⋮ Pareto \(Z\)-eigenvalue inclusion theorems for tensor eigenvalue complementarity problems ⋮ A new method for solving Pareto eigenvalue complementarity problems ⋮ On the symmetric quadratic eigenvalue complementarity problem ⋮ Tensor eigenvalue complementarity problems ⋮ A new descent method for symmetric non-monotone variational inequalities with application to eigenvalue complementarity problems ⋮ Solving inverse Pareto eigenvalue problems ⋮ Unconstrained formulation of standard quadratic optimization problems ⋮ Solving inverse cone-constrained eigenvalue problems ⋮ Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming ⋮ On solving difference of convex functions programs with linear complementarity constraints ⋮ Copositive optimization -- recent developments and applications ⋮ The descent algorithms for solving symmetric Pareto eigenvalue complementarity problem. ⋮ Interior point methods for solving Pareto eigenvalue complementarity problems ⋮ The semismooth and smoothing Newton methods for solving Pareto eigenvalue problem ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ A DC programming approach for solving the symmetric eigenvalue complementarity problem ⋮ Reconstructing a matrix from a partial sampling of Pareto eigenvalues ⋮ Unnamed Item ⋮ A kind of stochastic eigenvalue complementarity problems ⋮ On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm ⋮ On the solution of the inverse eigenvalue complementarity problem ⋮ On the quadratic eigenvalue complementarity problem over a general convex cone ⋮ A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem ⋮ Complementarity eigenvalue problems for nonlinear matrix pencils ⋮ DC programming and DCA: thirty years of developments ⋮ On the computation of all eigenvalues for the eigenvalue complementarity problem ⋮ A nonsmooth algorithm for cone-constrained eigenvalue problems ⋮ Residual algorithm for large-scale positive definite generalized eigenvalue problems ⋮ A class of second-order cone eigenvalue complementarity problems for higher-order tensors ⋮ Cone-constrained eigenvalue problems: Theory and algorithms ⋮ Inverse eigenvalue problems for linear complementarity systems ⋮ An approach based on dwindling filter method for positive definite generalized eigenvalue problem ⋮ On the cone eigenvalue complementarity problem for higher-order tensors ⋮ On an enumerative algorithm for solving eigenvalue complementarity problems ⋮ The second-order cone eigenvalue complementarity problem ⋮ Global inexact quasi-Newton method for nonlinear system of equations with constraints ⋮ On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras ⋮ Splitting methods for the Eigenvalue Complementarity Problem ⋮ On the maximal number of Pareto eigenvalues in a matrix of given order ⋮ Pareto eigenvalue inclusion intervals for tensors ⋮ The maximum tensor complementarity eigenvalues ⋮ Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem

Uses Software

• GAMS
• MINOS
• PATH Solver

Cites Work

• Unnamed Item
• Unnamed Item
• On the solution of NP-hard linear complementarity problems
• A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
• NP-completeness of the linear complementarity problem
• A sequential LCP method for bilevel linear programming
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• The directional instability problem in systems with frictional contacts.
• Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Numerical Optimization
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• The symmetric eigenvalue complementarity problem

This page was built for publication: The eigenvalue complementarity problem