Convex optimization approach to a single quadratically constrained quadratic minimization problem
type: Item
instance of: scholarly article
title: Convex optimization approach to a single quadratically constrained quadratic minimization problem
zbMATH Open document ID: 1204.90075
published in: CEJOR. Central European Journal of Operations Research
publication date: 2011-02-08T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 5847879
zbMATH Keywords: quadratic minimization
zbMATH Keywords: semidefinite optimization
author: Maziar Salahi
describes a project that uses: SeDuMi
describes a project that uses: Mosek
describes a project that uses: GQTPAR
MaRDI profile type: Publication
full work available at URL: s10100-009-0106-2
OpenAlex ID: W2056748641
cites work: Q4496016
cites work: On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: The complexity of optimizing over a simplex, hypercube or sphere: a short survey
cites work: The trust region subproblem and semidefinite programming*
cites work: Computing a Trust Region Step
cites work: Numerical Optimization
cites work: A Survey of the S-Lemma
cites work: A quadratically-convergent algorithm for general nonlinear programming problems
cites work: Q3802887
cites work: Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Q5675212
DOI: 10.1007/S10100-009-0106-2
Recommended article: Convex quadratic programming approach
Recommended article: Convex quadratic programming with one constraint and bounded variables
Recommended article: Quadratic optimization over one first-order cone
Recommended article: On the minimum-norm solution of convex quadratic programming
Recommended article: Solving quadratically constrained convex optimization problems with an interior-point method
Recommended article: Approximating global quadratic optimization with convex quadratic constraints
Recommended article: On convex relaxations for quadratically constrained quadratic programming
Recommended article: Q4016639
Recommended article: An unconstrained convex programming approach to solving convex quadratic programming problems
Recommended article: Quadratic optimization over a polyhedral cone
description: scientific article; zbMATH DE number 5847879