scientific article; zbMATH DE number 1489798
From MaRDI portal
Publication:4496015
zbMATH Open0985.90071MaRDI QIDQ4496015FDOQ4496015
Authors: Jos F. Sturm 
Publication date: 21 May 2002
Title of this publication is not available (Why is that?)
Recommendations
- Theoretical and algorithmic aspects in semi-definite optimization
- scientific article; zbMATH DE number 1047682
- Semidefinite programming
- Semidefinite Programming
- Semidefinite programming
- Semidefinite programming and combinatorial optimization
- Semidefinite programming and combinatorial optimization
- scientific article; zbMATH DE number 1944141
- Semidefinite programming and its applications to NP problems
- Semidefinite programming and approximation algorithms: a survey
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (17)
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
- Handbook of semidefinite programming. Theory, algorithms, and applications
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- Title not available (Why is that?)
- Facial reduction algorithms for conic optimization problems
- Matrix relaxations in combinatorial optimization
- On self-regular IPMs (with comments and rejoinder)
- Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming
- Embedding methods for semidefinite programming
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
- Some recent developments in spectrahedral computation
- Primal-dual stability in continuous linear optimization
- Polynomials nonnegative on a grid and discrete optimization
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- Conic convex programming and self-dual embedding
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4496015)
