Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
From MaRDI portal
Publication:1035905
DOI10.1007/s10957-009-9539-yzbMath1188.90190OpenAlexW2118333298MaRDI QIDQ1035905
Publication date: 4 November 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-009-9539-y
strong dualitysemidefinite relaxationconvexity of quadratic mapsextended S-lemmaquadratic matrix functions
Related Items (16)
A survey of hidden convex optimization ⋮ On the Hermitian structures of the solution to a pair of matrix equations ⋮ A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants ⋮ A first-order primal-dual algorithm for convex problems with applications to imaging ⋮ An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization ⋮ Formulas for calculating the extremum ranks and inertias of a four-term quadratic matrix-valued function and their applications ⋮ Linear Programming on the Stiefel Manifold ⋮ Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems ⋮ Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method ⋮ Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization ⋮ Chebyshev center of the intersection of balls: complexity, relaxation and approximation ⋮ Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints ⋮ Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension ⋮ On Chebyshev Center of the Intersection of Two Ellipsoids ⋮ Optimal input design for system identification using spectral decomposition ⋮ Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
- A remark on the convexity and positive definiteness concerning Hermitian matrices
- A remark on the rank of positive semidefinite matrices subject to affine constraints
- Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
- Solution methodologies for the smallest enclosing circle problem
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Convexity of quadratic transformations and its use in control and optimization
- Lectures on Modern Convex Optimization
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Robust Convex Optimization
- On the Field of Values of a Matrix
- Computing a Trust Region Step
- New Results on Quadratic Minimization
- The trust region subproblem and semidefinite programming*
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Worst-case MSE precoder design for imperfectly known MIMO communications channels
- Quadratic Matrix Programming
- Convex Analysis
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- A Survey of the S-Lemma
This page was built for publication: Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
