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