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...
Những tác giả chính: | Adachi, S, Nakatsukasa, Y |
---|---|
Định dạng: | Journal article |
Ngôn ngữ: | English |
Được phát hành: |
Springer Link
2017
|
Những quyển sách tương tự
-
On Convergence of Inexact Augmented Lagrangians for Separable and Equality Convex QCQP Problems without Constraint Qualification
Bằng: Zdenek Dostal, et al.
Được phát hành: (2017-01-01) -
Optimization of Weighting Window Functions for SAR Imaging via QCQP Approach
Bằng: Jin Liu, et al.
Được phát hành: (2020-01-01) -
Fast and accurate randomized algorithms for linear systems and eigenvalue problems
Bằng: Nakatsukasa, Y, et al.
Được phát hành: (2024) -
Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
Bằng: Adachi, S, et al.
Được phát hành: (2017) -
Finding Optimal Zone II Settings for Distance Relays in Coordination With Directional Overcurrent Relays Using QCQP Algorithm
Bằng: N. Praneeth, et al.
Được phát hành: (2024-01-01)