scientific article; zbMATH DE number 1534297

zbMath0957.90513MaRDI QIDQ4517106

Christoph Helmberg, Oustry, François

Publication date: 23 November 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items (12)

Using the eigenvalue relaxation for binary least-squares estimation problems ⋮ A Lipschitzian error bound for convex quadratic symmetric cone programming ⋮ Piecewise linear approximations in nonconvex nonsmooth optimization ⋮ A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions ⋮ Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ An approximate proximal bundle method to minimize a class of maximum eigenvalue functions ⋮ Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods ⋮ Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods ⋮ Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem ⋮ Nonsmooth bundle trust-region algorithm with applications to robust stability

This page was built for publication: