Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint

A nonconvex quadratically constrained quadratic programming (QCQP) with one constraint is usually solved via a dual SDP problem, or Moré’s algorithm based on iteratively solving linear systems. In this work we introduce an algorithm for QCQP that requires finding just one eigenpair of a generalized...

Täydet tiedot

Bibliografiset tiedot
Päätekijät: Adachi, S, Nakatsukasa, Y
Aineistotyyppi: Journal article
Kieli:English
Julkaistu: Springer Link 2017

Samankaltaisia teoksia