Pages that link to "Item:Q5356985"
From MaRDI portal
The following pages link to Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming (Q5356985):
Displaying 8 items.
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem (Q2010729) (← links)
- Cone-constrained rational eigenvalue problems (Q5230547) (← 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)
