Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming

DOI10.1007/978-3-319-18161-5_18zbMath1370.90275OpenAlexW1201656431MaRDI QIDQ5356985

Hoai An Le Thi, Yi-Shuai Niu, Tao Pham Dinh, Joaquim Joao Júdice

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_18

zbMATH Keywords

DCAeigenvalue problemDC programmingcomplementarity problemnonconvex polynomial programming

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (6)

On solving difference of convex functions programs with linear complementarity constraints ⋮ A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ DC programming and DCA: thirty years of developments ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem ⋮ Cone-constrained rational eigenvalue problems

Cites Work

• Unnamed Item
• On the quadratic eigenvalue complementarity problem
• A DC programming approach for solving the symmetric eigenvalue complementarity problem
• A nonsmooth algorithm for cone-constrained eigenvalue problems
• On an enumerative algorithm for solving eigenvalue complementarity problems
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Cone-constrained eigenvalue problems: Theory and algorithms
• A new method for solving second-order cone eigenvalue complementarity problems
• The eigenvalue complementarity problem
• Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
• On the symmetric quadratic eigenvalue complementarity problem
• Quadratic Eigenvalue Problems under Conic Constraints
• On the asymmetric eigenvalue complementarity problem
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• The symmetric eigenvalue complementarity problem
• Convex Analysis

This page was built for publication: Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming