Convex optimization approach to a single quadratically constrained quadratic minimization problem

DOI10.1007/s10100-009-0106-2zbMath1204.90075OpenAlexW2056748641MaRDI QIDQ623792

Maziar Salahi

Publication date: 8 February 2011

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-009-0106-2

zbMATH Keywords

semidefinite optimizationquadratic minimization

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items (2)

An optimization technique for verified location of trajectories with prescribed geometrical behaviour in the chaotic forced damped pendulum ⋮ Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint

Uses Software

• SeDuMi
• Mosek
• GQTPAR

Cites Work

• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• Lectures on Modern Convex Optimization
• Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
• Computing a Trust Region Step
• Numerical Optimization
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• The trust region subproblem and semidefinite programming*
• On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
• A quadratically-convergent algorithm for general nonlinear programming problems
• A Survey of the S-Lemma
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convex optimization approach to a single quadratically constrained quadratic minimization problem