Convex optimization approach to a single quadratically constrained quadratic minimization problem
From MaRDI portal
Publication:623792
DOI10.1007/S10100-009-0106-2zbMATH Open1204.90075OpenAlexW2056748641MaRDI QIDQ623792FDOQ623792
Authors: 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
Recommendations
- Convex quadratic programming approach
- Convex quadratic programming with one constraint and bounded variables
- Quadratic optimization over one first-order cone
- On the minimum-norm solution of convex quadratic programming
- Solving quadratically constrained convex optimization problems with an interior-point method
- Approximating global quadratic optimization with convex quadratic constraints
- On convex relaxations for quadratically constrained quadratic programming
- scientific article; zbMATH DE number 89074
- An unconstrained convex programming approach to solving convex quadratic programming problems
- Quadratic optimization over a polyhedral cone
Cites Work
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- scientific article; zbMATH DE number 3410870 (Why is no real title available?)
- A Survey of the S-Lemma
- A quadratically-convergent algorithm for general nonlinear programming problems
- Computing a Trust Region Step
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Numerical Optimization
- On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- The trust region subproblem and semidefinite programming*
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited In (10)
- Quadratic optimization over one first-order cone
- Minimization of a convex quadratic function with two-sided constraints for variables
- On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
- An optimization technique for verified location of trajectories with prescribed geometrical behaviour in the chaotic forced damped pendulum
- Two relaxation methods for rank minimization problems
- A revisit to quadratic programming with one inequality quadratic constraint via matrix pencil
- A short note on \(\min_{x\in \mathbb{R}^n}\frac{\| Ax-b\|^2}{1+\| x \| ^2}\)
- Title not available (Why is no real title available?)
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint
Uses Software
This page was built for publication: Convex optimization approach to a single quadratically constrained quadratic minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623792)
