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...
मुख्य लेखकों: | Adachi, S, Nakatsukasa, Y |
---|---|
स्वरूप: | Journal article |
भाषा: | English |
प्रकाशित: |
Springer Link
2017
|
समान संसाधन
-
On Convergence of Inexact Augmented Lagrangians for Separable and Equality Convex QCQP Problems without Constraint Qualification
द्वारा: Zdenek Dostal, और अन्य
प्रकाशित: (2017-01-01) -
Optimization of Weighting Window Functions for SAR Imaging via QCQP Approach
द्वारा: Jin Liu, और अन्य
प्रकाशित: (2020-01-01) -
Fast and accurate randomized algorithms for linear systems and eigenvalue problems
द्वारा: Nakatsukasa, Y, और अन्य
प्रकाशित: (2024) -
Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
द्वारा: Adachi, S, और अन्य
प्रकाशित: (2017) -
Finding Optimal Zone II Settings for Distance Relays in Coordination With Directional Overcurrent Relays Using QCQP Algorithm
द्वारा: N. Praneeth, और अन्य
प्रकाशित: (2024-01-01)