Pages that link to "Item:Q429495"

The following pages link to A DC programming approach for solving the symmetric eigenvalue complementarity problem (Q429495):

Displaying 31 items.

• DC approximation approaches for sparse optimization (Q319281) (← links)
• On the quadratic eigenvalue complementarity problem (Q330258) (← links)
• Exact penalty and error bounds in DC programming (Q427389) (← links)
• On the solution of the inverse eigenvalue complementarity problem (Q467406) (← links)
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
• On an enumerative algorithm for solving eigenvalue complementarity problems (Q742298) (← links)
• A kind of stochastic eigenvalue complementarity problems (Q1721370) (← links)
• On the quadratic eigenvalue complementarity problem over a general convex cone (Q1732226) (← links)
• DC programming and DCA: thirty years of developments (Q1749443) (← links)
• Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem (Q2010729) (← links)
• A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem (Q2023685) (← 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)
• Solving the index tracking problem: a continuous optimization approach (Q2673302) (← 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)
• 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)
• The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results (Q5356986) (← links)
• A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems (Q5373928) (← links)
• Solving inverse Pareto eigenvalue problems (Q6043103) (← links)
• The descent algorithm for solving the symmetric eigenvalue complementarity problem (Q6097703) (← links)
• On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)
• The descent algorithms for solving symmetric Pareto eigenvalue complementarity problem. (Q6175143) (← 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 convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems (Q6635808) (← links)