Foundations of set-semidefinite optimization
From MaRDI portal
Recommendations
Cites work
- A characterization of positive-semidefinite operators on a Hilbert space
- A Copositive Programming Approach to Graph Partitioning
- A copositivity probe
- A test for copositive matrices
- Algorithmic copositivity detection by simplicial partition
- Applications of semidefinite programming
- Approximation of the stability number of a graph via copositive programming
- Bishop-Phelps cones in optimization
- Copositive realxation for genera quadratic programming
- Criteria for copositive matrices using simplices and barycentric coordinates
- First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems
- Handbook of semidefinite programming. Theory, algorithms, and applications
- scientific article; zbMATH DE number 3884831 (Why is no real title available?)
- scientific article; zbMATH DE number 1186925 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 5493304 (Why is no real title available?)
- Introduction to the Theory of Nonlinear Optimization
- Necessary and sufficient conditions for quadratic minimality
- On Cones of Nonnegative Quadratic Functions
- On copositive programming and standard quadratic optimization problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Quadratic-programming criteria for copositive matrices
- Role of copositivity in optimality criteria for nonconvex optimization problems
- Semidefinite optimization
- Semidefinite Programming
- Semidefinite programming in combinatorial optimization
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- The maximum clique problem
Cited in
(7)- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Moment approximations for set-semidefinite polynomials
- Representing quadratically constrained quadratic programs as generalized copositive programs
- scientific article; zbMATH DE number 2096864 (Why is no real title available?)
- scientific article; zbMATH DE number 5493304 (Why is no real title available?)
- Computing the recession cone of a convex upper image via convex projection
This page was built for publication: Foundations of set-semidefinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5188753)
