References in zbMATH (referenced in 71 articles )

Showing results 1 to 20 of 71.
Sorted by year (citations)

1 2 3 4 next

  1. Kobayashi, Ken; Takano, Yuich: A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (2020)
  2. Yang, Qingzhi; Li, Yiyong; Huang, Pengfei: A novel formulation of the max-cut problem and related algorithm (2020)
  3. Bellavia, Stefania; Gondzio, Jacek; Porcelli, Margherita: An inexact dual logarithmic barrier method for solving sparse semidefinite programs (2019)
  4. Letchford, Adam N.; Parkes, Andrew J.: A guide to conic optimisation and its applications (2018)
  5. Zhang, Richard Y.; White, Jacob K.: GMRES-accelerated ADMM for quadratic objectives (2018)
  6. Ardestani-Jaafari, Amir; Delage, Erick: Robust optimization of sums of piecewise linear functions with application to inventory problems (2016)
  7. Dong, Hongbo: Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (2016)
  8. Ling, Aifan: An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (2016)
  9. Yang, Wanping; Zhao, Jinkai; Xu, Fengmin: An efficient method for convex constrained rank minimization problems based on DC programming (2016)
  10. de Klerk, Etienne; Pasechnik, Dmitrii V.; Salazar, Gelasio: Book drawings of complete bipartite graphs (2014)
  11. Gicquel, C.; Lisser, A.; Minoux, M.: An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (2014)
  12. Wen, Zaiwen; Yin, Wotao: A feasible method for optimization with orthogonality constraints (2013)
  13. Gorge, Agnès; Lisser, Abdel; Zorgati, Riadh: Stochastic nuclear outages semidefinite relaxations (2012)
  14. Grippo, Luigi; Palagi, Laura; Piacentini, Mauro; Piccialli, Veronica; Rinaldi, Giovanni: SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (2012)
  15. Palagi, Laura; Piccialli, Veronica; Rendl, Franz; Rinaldi, Giovanni; Wiegele, Angelika: Computational approaches to MAX-cut (2012)
  16. Wen, Zaiwen; Goldfarb, Donald; Scheinberg, Katya: Block coordinate descent methods for semidefinite programming (2012)
  17. Grippo, Luigi; Palagi, Laura; Piccialli, Veronica: An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (2011)
  18. Zhu, Yuntao; Zhang, Junshan; Partel, Kautilya: Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach (2011)
  19. de Klerk, Etienne: Exploiting special structure in semidefinite programming: a survey of theory and applications (2010)
  20. Ivanov, I. D.; de Klerk, E.: Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster (2010)

1 2 3 4 next