1998
DOI: 10.1088/0266-5611/14/4/009
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for quadratic optimization with one quadratic constraint and bounds on the variables

Abstract: This paper presents an efficient algorithm to solve a constrained optimization problem with a quadratic object function, one quadratic constraint and (positivity) bounds on the variables. Against little computational cost, the algorithm allows for the inclusion of positivity of the solution as prior knowledge. This is very useful for the solution of those (linear) inverse problems where negative solutions are unphysical.The algorithm rewrites the solution as a function of the Lagrange multipliers, which is ach… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
29
0

Year Published

2004
2004
2021
2021

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(29 citation statements)
references
References 7 publications
(7 reference statements)
0
29
0
Order By: Relevance
“…To begin with, for definite feasible QCQP there always exists a global solution x * . [24]) For a definite feasible QCQP (2), there exist x * ∈ R n , λ * ≥ 0 such that the conditions (8) hold.…”
Section: Definite Feasible Qcqp: Strictly Feasible and Definitementioning
confidence: 99%
See 2 more Smart Citations
“…To begin with, for definite feasible QCQP there always exists a global solution x * . [24]) For a definite feasible QCQP (2), there exist x * ∈ R n , λ * ≥ 0 such that the conditions (8) hold.…”
Section: Definite Feasible Qcqp: Strictly Feasible and Definitementioning
confidence: 99%
“…Similarly, if A 0, takingλ = 0 shows the pencil is definite, so such QCQP is definite feasible as long as it is strictly feasible. Indeed a number of studies focus on such cases [8,9].…”
Section: Theorem 2 (Morémentioning
confidence: 99%
See 1 more Smart Citation
“…30. This algorithm is based on the active set approach from quadratic programming and can be effectively combined with the matrix decompositions presented in the next section.…”
Section: Minimum Fisher Informationmentioning
confidence: 99%
“…Application of a statistical approach to atmospheric remote sensing can be found in Rodgers (2000). A constrained optimization method -where a smoothness function is used as quadratic constraint -is used successfully by Fehmers et al (1998) in the field of the tomography of the ionosphere. If good a priori information is available these inversion techniques are useful to include such information.…”
Section: Overview Over Inversion Techniquesmentioning
confidence: 99%