On local convexity of quadratic transformations
From MaRDI portal
(Redirected from Publication:489135)
Abstract: In this paper, we improve Polyak's local convexity result for quadratic transformations. Extension and open problems are also presented.
Cites work
- A Survey of the S-Lemma
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Convexity of nonlinear image of a small ball with applications to optimization
- Convexity of quadratic transformations and its use in control and optimization
- Duality theorems for certain nonconvex extremal problems
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 3368525 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Matrix Analysis
- 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
- On the Field of Values of a Matrix
- On the mapping of quadratic forms
- On the Polyak convexity principle and its application to variational analysis
- S-lemma with equality and its applications
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- The convexity principle and its applications
Cited in
(6)- Transformation of quasiconvex functions to eliminate local minima
- An extension of Yuan's lemma and its applications in optimization
- A survey of hidden convex optimization
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- New versions of Newton method: step-size choice, convergence domain and under-determined equations
- Convexity of a small ball under quadratic map
This page was built for publication: On local convexity of quadratic transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489135)
