The descent algorithm for solving the symmetric eigenvalue complementarity problem

DOI10.1016/j.jmaa.2023.127320zbMath1519.90246OpenAlexW4365511793MaRDI QIDQ6097703

Yuan Lei, Lin Zhu

Publication date: 7 June 2023

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2023.127320

zbMATH Keywords

global convergencequadratic programmingdescentcomplementarity problem

Mathematics Subject Classification ID

Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• A DC programming approach for solving the symmetric eigenvalue complementarity problem
• A nonsmooth algorithm for cone-constrained eigenvalue problems
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
• Eigenvalue problems for nonlinear elliptic variational inequalities on a cone
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• On eigenvalues induced by a cone constraint.
• The directional instability problem in systems with frictional contacts.
• A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
• Accelerating the DC algorithm for smooth functions
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
• New results on Pareto spectra
• On the computation of all eigenvalues for the eigenvalue complementarity problem
• Cone-constrained eigenvalue problems: Theory and algorithms
• A note on the relation between the Fučík spectrum and Pareto eigenvalues
• A new method for solving Pareto eigenvalue complementarity problems
• The semismooth and smoothing Newton methods for solving Pareto eigenvalue problem
• On linear-time algorithms for the continuous quadratic Knapsack problem
• On the asymmetric eigenvalue complementarity problem
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• The symmetric eigenvalue complementarity problem
• An alternating direction method of multipliers for the eigenvalue complementarity problem
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• Combined SVM-based feature selection and classification

This page was built for publication: The descent algorithm for solving the symmetric eigenvalue complementarity problem