A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
type: Item
instance of: scholarly article
title: A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
zbMATH Open document ID: 1411.90335
author: Carmo P. Brás
author: Andreas Fischer
author: K. Schönefeld
author: Sarah Seifert
author: Joaquim J. Júdice
published in: Applied Mathematics and Computation
publication date: 2019-03-27T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7043140
zbMATH Keywords: complementarity problems
zbMATH Keywords: eigenvalue problems
zbMATH Keywords: nonlinear programming
zbMATH Keywords: large-scale optimization
describes a project that uses: Matlab
describes a project that uses: SPG
MaRDI profile type: Publication
full work available at URL: j.amc.2016.09.005
OpenAlex ID: W2522469375
cites work: A new method for solving second-order cone eigenvalue complementarity problems
cites work: A nonsmooth algorithm for cone-constrained eigenvalue problems
cites work: Copositivity and constrained fractional quadratic problems
cites work: Two-Point Step Size Gradient Methods
cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
cites work: Algorithm 813
cites work: Evolution towards the maximum clique
cites work: On copositive programming and standard quadratic optimization problems
cites work: Variational inequality formulation of the asymmetric eigenvalue complementarity problem and its solution by means of gap functions
cites work: A feasible active set method with reoptimization for convex quadratic mixed-integer programming
cites work: The Linear Complementarity Problem
cites work: A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
cites work: Q5687277
cites work: Benchmarking optimization software with performance profiles.
cites work: A block active set algorithm for large-scale quadratic programming with box constraints
cites work: The second-order cone eigenvalue complementarity problem
cites work: On the computation of all eigenvalues for the eigenvalue complementarity problem
cites work: On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
cites work: The eigenvalue complementarity problem
cites work: On the asymmetric eigenvalue complementarity problem
cites work: Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
cites work: Q5491447
cites work: Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
cites work: The directional instability problem in systems with frictional contacts.
cites work: Cone-constrained eigenvalue problems: Theory and algorithms
cites work: The symmetric eigenvalue complementarity problem
cites work: Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
cites work: Quadratic Eigenvalue Problems under Conic Constraints
cites work: On eigenvalues induced by a cone constraint.
cites work: Local minima of quadratic forms on convex cones
cites work: An algorithm for quadratic ℓ1-regularized optimization with a flexible active-set strategy
cites work: An improved algorithm to test copositivity
cites work: Convex separable minimization subject to bounded variables
cites work: On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras
cites work: Depth-first simplicial partition for copositivity detection, with an application to MaxClique
DOI: 10.1016/J.AMC.2016.09.005
description: scientific article; zbMATH DE number 7043140