Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization

DOI10.1007/S00245-001-0034-6MaRDI QIDQ1599463zbMATH OpenOpenAlexFDO

Authors Jean-Baptiste Hiriart-Urruty, Mounir Torki

Publication date 10 June 2002

Published in Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00245-001-0034-6

zbMATH Keywords

joint positive definitenessquadratic functionsrange convexity

Mathematics Subject Classification ID

Set-valued and variational analysis (49J53) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Convex programming (90C25)

Review text

A review of different results concerning convexity of images by quadratic mappings is first offered putting these results in a chronological perspective. Next, these results are interpreted from a geometrical point of view in order to provide new and comprehensive proofs and to generalize them in a more complex and abstract context.

Recommendations

• Quasi-convex programming revisited
• Persistency in quadratic 0-1 optimization
• scientific article; zbMATH DE number 16313
• Quadratic optimization with switching variables: the convex hull for \(n=2\)
• Quadratic Approximations in Convex Nondifferentiable Optimization
• Convex Relaxations of (0, 1)-Quadratic Programming
• Convex parametric piecewise quadratic optimization: theory and algorithms
• Convexity and optimization in \({\mathbb R^n}\)
• scientific article; zbMATH DE number 1130735
• Quadratic optimization over a polyhedral cone

Cited in

(26)

• Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
• An extension of Yuan's lemma and its applications in optimization
• Elliptic quadratic operator equations
• On two questions of optimization theory concerning quadratic mappings
• Theorems of the alternative for inequality systems of real polynomials
• On the classical necessary second-order optimality conditions
• Convexity of quadratic transformations and its use in control and optimization
• Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
• A fresh geometrical look at the general S-procedure
• Theorems of the alternative revisited and some extensions of Yuan's lemma
• Joint numerical ranges: recent advances and applications minicourse by V. Müller and Yu. Tomilov
• Generalized S-lemma and strong duality in nonconvex quadratic programming
• Image space approach and subdifferentials of integral functionals
• An approximation theory of matrix rank minimization and its application to quadratic equations
• Convexity/nonconvexity certificates for power flow analysis
• A note on surjective polynomial operators
• Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization
• Solving the problem of simultaneous diagonalization of complex symmetric matrices via congruence
• Optimal input design for system identification using spectral decomposition
• New results on Hermitian matrix rank-one decomposition
• Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity
• Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities
• On the S-procedure and some variants
• Kalman-Popov-Yakubovich Lemma and the \(S\)-procedure: a historical essay
• The Dines theorem and some other properties of quadratic mappings
• 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

This page was built for publication: Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599463)