A DC programming approach for solving the symmetric eigenvalue complementarity problem
From MaRDI portal
Publication:429495
DOI10.1007/s10589-010-9388-5zbMath1241.90153OpenAlexW2057932996MaRDI QIDQ429495
Tao Pham Dinh, Joaquim Joao Júdice, Hoai An Le Thi, Mahdi Moeini
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9388-5
Related Items
Complementary eigenvalues of graphs, On the numerical solution of the quadratic eigenvalue complementarity problem, DC approximation approaches for sparse optimization, On the quadratic eigenvalue complementarity problem, DC Programming and DCA for General DC Programs, On the symmetric quadratic eigenvalue complementarity problem, A new descent method for symmetric non-monotone variational inequalities with application to eigenvalue complementarity problems, Solving the index tracking problem: a continuous optimization approach, Solving inverse Pareto eigenvalue problems, The descent algorithm for solving the symmetric eigenvalue complementarity problem, Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming, The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results, On solving difference of convex functions programs with linear complementarity constraints, The descent algorithms for solving symmetric Pareto eigenvalue complementarity problem., A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program, Interior point methods for solving Pareto eigenvalue complementarity problems, Exact penalty and error bounds in DC programming, A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems, A kind of stochastic eigenvalue complementarity problems, On the solution of the inverse eigenvalue complementarity problem, On the quadratic eigenvalue complementarity problem over a general convex cone, Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization, DC programming and DCA: thirty years of developments, On the computation of all eigenvalues for the eigenvalue complementarity problem, Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem, A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem, On an enumerative algorithm for solving eigenvalue complementarity problems, The second-order cone eigenvalue complementarity problem, Splitting methods for the Eigenvalue Complementarity Problem, An alternating direction method of multipliers for the eigenvalue complementarity problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of two DC algorithms in quadratic programming
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Signal and image approximation with level-set constraints
- Numerical resolution of cone-constrained eigenvalue problems
- On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras
- NP-completeness of the linear complementarity problem
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Eigenvalue computation in the 20th century
- Computing eigenelements of real symmetric matrices via optimization
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Numerical methods for general and structured eigenvalue problems.
- Collusive game solutions via optimization
- The eigenvalue complementarity problem
- A continuous approch for globally solving linearly constrained quadratic
- On the asymmetric eigenvalue complementarity problem
- Optimization-based stability analysis of structures under unilateral constraints
- DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm
- Unconstrained Variational Principles for Eigenvalues of Real Symmetric Matrices
- Globally and Rapidly Convergent Algorithms for Symmetric Eigenproblems
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- The symmetric eigenvalue complementarity problem
- Combinatorial Image Analysis
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
- Convex Analysis
- Combined SVM-based feature selection and classification
