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
From MaRDI portal
Publication:946350
DOI10.1007/s10898-006-9127-8zbMath1151.90036OpenAlexW1990558081MaRDI QIDQ946350
Publication date: 23 September 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9127-8
Related Items
Geometric algorithms for finding a point in the intersection of balls, Unnamed Item, A survey of hidden convex optimization, Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap, An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization, An Optimal First Order Method Based on Optimal Quadratic Averaging, Linear Programming on the Stiefel Manifold, Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems, On local convexity of quadratic transformations, Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma, Theorems of the alternative for inequality systems of real polynomials, Chebyshev center of the intersection of balls: complexity, relaxation and approximation, Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality, Convexity/Nonconvexity Certificates for Power Flow Analysis, Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension, Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming, Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization, Connectivity of Quadratic Hypersurfaces and Its Applications in Optimization, Part I: General Theory, S-lemma with equality and its applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a subproblem of trust region algorithms for constrained optimization
- Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
- Efficient algorithms for the smallest enclosing ball problem
- 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
- Global Optimization with Polynomials and the Problem of Moments
- Lectures on Modern Convex Optimization
- Computing a Trust Region Step
- Linear Matrix Inequalities in System and Control Theory
- Determinant Maximization with Linear Matrix Inequality Constraints
- New Results on Quadratic Minimization
- The trust region subproblem and semidefinite programming*
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Quadratic Matrix Programming
- Complex Quadratic Optimization and Semidefinite Programming
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Handbook of semidefinite programming. Theory, algorithms, and applications
