Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
From MaRDI portal
Publication:1599463
DOI10.1007/s00245-001-0034-6zbMath1004.52003OpenAlexW2067785816MaRDI QIDQ1599463
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
Convex programming (90C25) Set-valued and variational analysis (49J53) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (25)
A fresh geometrical look at the general S-procedure ⋮ On the S-procedure and some variants ⋮ Generalized S-lemma and strong duality in nonconvex quadratic programming ⋮ Theorems of the alternative revisited and some extensions of Yuan's lemma ⋮ Unnamed Item ⋮ An extension of Yuan's lemma and its applications in optimization ⋮ Kalman-Popov-Yakubovich Lemma and the \(S\)-procedure: a historical essay ⋮ Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities ⋮ Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity ⋮ An approximation theory of matrix rank minimization and its application to quadratic equations ⋮ The Dines theorem and some other properties of quadratic mappings ⋮ Joint numerical ranges: recent advances and applications minicourse by V. Müller and Yu. Tomilov ⋮ Image space approach and subdifferentials of integral functionals ⋮ Solving the Problem of Simultaneous Diagonalization of Complex Symmetric Matrices via Congruence ⋮ Elliptic quadratic operator equations ⋮ 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 ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ On two questions of optimization theory concerning quadratic mappings ⋮ Theorems of the alternative for inequality systems of real polynomials ⋮ New results on Hermitian matrix rank-one decomposition ⋮ On the classical necessary second-order optimality conditions ⋮ Convexity/Nonconvexity Certificates for Power Flow Analysis ⋮ Optimal input design for system identification using spectral decomposition ⋮ 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
This page was built for publication: Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
