A new barrier for a class of semidefinite problems

DOI10.1051/ro:2006022zbMath1190.90277OpenAlexW2169036319MaRDI QIDQ3635704

No author found.

Publication date: 6 July 2009

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105351

zbMATH Keywords

semidefinite optimizationinterior point methodscentral pathbarrier function

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items (2)

On the central paths in symmetric cone programming ⋮ On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization

Cites Work

• Unnamed Item
• Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
• Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• New self-concordant barrier for the hypercube
• Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
• Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• On the Convergence of the Central Path in Semidefinite Optimization
• Lower Bounds for the Partitioning of Graphs

This page was built for publication: A new barrier for a class of semidefinite problems