A nonsmooth algorithm for cone-constrained eigenvalue problems

DOI10.1007/s10589-009-9297-7zbMath1220.90128OpenAlexW1963789989MaRDI QIDQ540650

Samir Adly, Alberto Seeger

Publication date: 3 June 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9297-7

zbMATH Keywords

matrix pencilcomplementarity problemsemismooth Newton methodcone-constrained eigenvalue problemLorentz conepolyhedral convex cone

Mathematics Subject Classification ID

Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (45)

Variational inequality formulation of circular cone eigenvalue complementarity problems ⋮ Complementary eigenvalues of graphs ⋮ Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem ⋮ On the numerical solution of the quadratic eigenvalue complementarity problem ⋮ On the quadratic eigenvalue complementarity problem ⋮ Extended semismooth Newton method for functions with values in a cone ⋮ A new method for solving Pareto eigenvalue complementarity problems ⋮ On the symmetric quadratic eigenvalue complementarity problem ⋮ Tensor eigenvalue complementarity problems ⋮ Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues ⋮ New results on Pareto spectra ⋮ A new descent method for symmetric non-monotone variational inequalities with application to eigenvalue complementarity problems ⋮ Solving inverse Pareto eigenvalue problems ⋮ Repetition of spectral radiuses among connected induced subgraphs ⋮ The descent algorithm for solving the symmetric eigenvalue complementarity problem ⋮ Solving inverse cone-constrained eigenvalue problems ⋮ Localization sets for Pareto eigenvalues with applications ⋮ Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming ⋮ The descent algorithms for solving symmetric Pareto eigenvalue complementarity problem. ⋮ Interior point methods for solving Pareto eigenvalue complementarity problems ⋮ Complementarity eigenvalue analysis of connected graphs ⋮ Reconstructing a matrix from a partial sampling of Pareto eigenvalues ⋮ A new Jacobian-like method for the polyhedral cone-constrained eigenvalue problem ⋮ A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems ⋮ Unnamed Item ⋮ On the solution of the inverse eigenvalue complementarity problem ⋮ 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 ⋮ On the computation of all eigenvalues for the eigenvalue complementarity problem ⋮ Spectral analysis of coupled linear complementarity problems ⋮ Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem ⋮ A class of second-order cone eigenvalue complementarity problems for higher-order tensors ⋮ Inverse eigenvalue problems for linear complementarity systems ⋮ Equilibrium problems involving the Lorentz cone ⋮ On an enumerative algorithm for solving eigenvalue complementarity problems ⋮ Critical elastic parameters motivating divergence instability of frictional composite infinitely long media ⋮ The second-order cone eigenvalue complementarity problem ⋮ Cone-constrained rational eigenvalue problems ⋮ Splitting methods for the Eigenvalue Complementarity Problem ⋮ On the maximal number of Pareto eigenvalues in a matrix of given order ⋮ An alternating direction method of multipliers for the eigenvalue complementarity problem ⋮ The maximum tensor complementarity eigenvalues ⋮ A new method for solving second-order cone eigenvalue complementarity problems ⋮ Complementarity problems with respect to Loewnerian cones

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some P-properties for linear transformations on Euclidean Jordan algebras
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• A family of NCP functions and a descent method for the nonlinear complementarity problem
• Some inertia theorems in Euclidean Jordan algebras
• Numerical resolution of cone-constrained eigenvalue problems
• Applications of second-order cone programming
• Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
• Positive operators on the \(n\)-dimensional ice cream cone
• A new class of semismooth Newton-type methods for nonlinear complementarity problems
• Nonsmooth equations in optimization. Regularity, calculus, methods and applications
• On eigenvalues induced by a cone constraint.
• The directional instability problem in systems with frictional contacts.
• Local minima of quadratic forms on convex cones
• A nonsmooth version of Newton's method
• Growth behavior of a class of merit functions for the nonlinear complementarity problem
• The eigenvalue complementarity problem
• Smoothing Functions for Second-Order-Cone Complementarity Problems
• Exponential Nonnegativity on the Ice Cream Cone
• Newton's Method for B-Differentiable Equations
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• The symmetric eigenvalue complementarity problem
• Set-valued analysis

This page was built for publication: A nonsmooth algorithm for cone-constrained eigenvalue problems