Pages that link to "Item:Q2867409"

The following pages link to Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem (Q2867409):

Displaying 25 items.

• On the quadratic eigenvalue complementarity problem (Q330258) (← links)
• The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
• On the solution of the inverse eigenvalue complementarity problem (Q467406) (← links)
• On an enumerative algorithm for solving eigenvalue complementarity problems (Q742298) (← links)
• On the quadratic eigenvalue complementarity problem over a general convex cone (Q1732226) (← links)
• A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem (Q1734301) (← links)
• DC programming and DCA: thirty years of developments (Q1749443) (← links)
• Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem (Q2010729) (← links)
• On the computation of all eigenvalues for the eigenvalue complementarity problem (Q2250083) (← links)
• Complementary eigenvalues of graphs (Q2359565) (← links)
• A new descent method for symmetric non-monotone variational inequalities with application to eigenvalue complementarity problems (Q2412840) (← links)
• On the numerical solution of the quadratic eigenvalue complementarity problem (Q2630755) (← links)
• The second-order cone eigenvalue complementarity problem (Q2811479) (← links)
• On the symmetric quadratic eigenvalue complementarity problem (Q2926052) (← links)
• DC Programming and DCA for General DC Programs (Q3192952) (← links)
• DC Programming Approaches for BMI and QMI Feasibility Problems (Q3192953) (← links)
• An alternating direction method of multipliers for the eigenvalue complementarity problem (Q4999333) (← links)
• Splitting methods for the Eigenvalue Complementarity Problem (Q5238067) (← links)
• Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming (Q5356985) (← links)
• A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems (Q5373928) (← links)
• Solving inverse Pareto eigenvalue problems (Q6043103) (← links)
• On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)
• A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)
• A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs (Q6536842) (← links)
• On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (Q6550977) (← links)