Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem

DOI10.1016/j.amc.2019.02.017zbMath1428.90137arXiv1712.00227OpenAlexW2796439471WikidataQ128389912 ScholiaQ128389912MaRDI QIDQ2010729

Hoai An Le Thi, Yi-Shuai Niu, Joaquim Joao Júdice, Tao Pham Dinh

Publication date: 27 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.00227

zbMATH Keywords

global optimizationeigenvalue problemcomplementarity problemdc programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems

Uses Software

• YALMIP
• Ipopt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A semismooth Newton method for tensor eigenvalue complementarity problem
• On the quadratic eigenvalue complementarity problem
• An efficient DC programming approach for portfolio decision with higher moments
• A DC programming approach for solving the symmetric eigenvalue complementarity problem
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
• A nonsmooth algorithm for cone-constrained eigenvalue problems
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras
• Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
• The directional instability problem in systems with frictional contacts.
• On the quadratic eigenvalue complementarity problem over a general convex cone
• A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
• Complementarity eigenvalue problems for nonlinear matrix pencils
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• On the computation of all eigenvalues for the eigenvalue complementarity problem
• Cone-constrained eigenvalue problems: Theory and algorithms
• A new method for solving second-order cone eigenvalue complementarity problems
• Complementary eigenvalues of graphs
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• On the numerical solution of the quadratic eigenvalue complementarity problem
• The second-order cone eigenvalue complementarity problem
• Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
• On the symmetric quadratic eigenvalue complementarity problem
• Quadratic Eigenvalue Problems under Conic Constraints
• DC Programming Approaches for BMI and QMI Feasibility Problems
• On the asymmetric eigenvalue complementarity problem
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming
• A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
• Introduction to global optimization.

This page was built for publication: Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem