Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
From MaRDI portal
Publication:2867409
Recommendations
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- Solving the quadratic eigenvalue complementarity problem by DC programming
- Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
- Variational inequality formulation of the asymmetric eigenvalue complementarity problem and its solution by means of gap functions
- On the asymmetric eigenvalue complementarity problem
Cites work
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Cone-constrained eigenvalue problems: Theory and algorithms
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- Local minima of quadratic forms on convex cones
- On eigenvalues induced by a cone constraint.
- On the asymmetric eigenvalue complementarity problem
- On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The directional instability problem in systems with frictional contacts.
- The eigenvalue complementarity problem
- The symmetric eigenvalue complementarity problem
Cited in
(29)- Complementary eigenvalues of graphs
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- Splitting methods for the eigenvalue complementarity problem
- An alternating direction method of multipliers for the eigenvalue complementarity problem
- Variational inequality formulation of circular cone eigenvalue complementarity problems
- On the quadratic eigenvalue complementarity problem over a general convex cone
- Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
- On an enumerative algorithm for solving eigenvalue complementarity problems
- DC programming and DCA: thirty years of developments
- On solving difference of convex functions programs with linear complementarity constraints
- Solving the quadratic eigenvalue complementarity problem by DC programming
- On the numerical solution of the quadratic eigenvalue complementarity problem
- Solving inverse Pareto eigenvalue problems
- 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 DC programming approach for solving the symmetric eigenvalue complementarity problem
- 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
- On the computation of all eigenvalues for the eigenvalue complementarity problem
- DC Programming Approaches for BMI and QMI Feasibility Problems
- The second-order cone eigenvalue complementarity problem
- On the symmetric quadratic eigenvalue complementarity problem
- DC programming and DCA for general DC programs
- A new descent method for symmetric non-monotone variational inequalities with application to eigenvalue complementarity problems
- The descent algorithm for solving the symmetric eigenvalue complementarity problem
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials
This page was built for publication: Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867409)
