Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem

DOI10.1080/10556788.2011.645543zbMath1307.90145OpenAlexW2007456075MaRDI QIDQ2867409

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

Publication date: 19 December 2013

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2011.645543

zbMATH Keywords

DCAnonlinear programmingcomplementarity problemseigenvalue problemsDC programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Complementary eigenvalues of graphs ⋮ On the numerical solution of the quadratic eigenvalue complementarity problem ⋮ On the quadratic eigenvalue complementarity problem ⋮ DC Programming and DCA for General DC Programs ⋮ DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ On the symmetric quadratic eigenvalue complementarity problem ⋮ A new descent method for symmetric non-monotone variational inequalities with application to eigenvalue complementarity problems ⋮ Solving inverse Pareto eigenvalue problems ⋮ Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming ⋮ 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 ⋮ Interior point methods for solving Pareto eigenvalue complementarity problems ⋮ A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems ⋮ The space decomposition theory for a class of eigenvalue optimizations ⋮ 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 ⋮ DC programming and DCA: thirty years of developments ⋮ On the computation of all eigenvalues for the eigenvalue complementarity problem ⋮ Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem ⋮ On an enumerative algorithm for solving eigenvalue complementarity problems ⋮ The second-order cone eigenvalue complementarity problem ⋮ Splitting methods for the Eigenvalue Complementarity Problem ⋮ An alternating direction method of multipliers for the eigenvalue complementarity problem

Uses Software

• Matlab
• CPLEX
• YALMIP

Cites Work

• On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras
• Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
• On eigenvalues induced by a cone constraint.
• The directional instability problem in systems with frictional contacts.
• 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
• Local minima of quadratic forms on convex cones
• The eigenvalue complementarity problem
• On the asymmetric eigenvalue complementarity problem
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• The symmetric eigenvalue complementarity problem