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...

Descrizione completa

Dettagli Bibliografici
Autori principali: Adachi, S, Nakatsukasa, Y
Natura: Journal article
Lingua:English
Pubblicazione: Springer Link 2017

Documenti analoghi