References in zbMATH (referenced in 67 articles )

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

1 2 3 4 next

  1. Zhang, Richard Y.; White, Jacob K.: GMRES-accelerated ADMM for quadratic objectives (2018)
  2. Ardestani-Jaafari, Amir; Delage, Erick: Robust optimization of sums of piecewise linear functions with application to inventory problems (2016)
  3. Dong, Hongbo: Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (2016)
  4. Ling, Aifan: An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (2016)
  5. Yang, Wanping; Zhao, Jinkai; Xu, Fengmin: An efficient method for convex constrained rank minimization problems based on DC programming (2016)
  6. de Klerk, Etienne; Pasechnik, Dmitrii V.; Salazar, Gelasio: Book drawings of complete bipartite graphs (2014)
  7. Gicquel, C.; Lisser, A.; Minoux, M.: An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (2014)
  8. Wen, Zaiwen; Yin, Wotao: A feasible method for optimization with orthogonality constraints (2013)
  9. Gorge, Agnès; Lisser, Abdel; Zorgati, Riadh: Stochastic nuclear outages semidefinite relaxations (2012)
  10. Grippo, Luigi; Palagi, Laura; Piacentini, Mauro; Piccialli, Veronica; Rinaldi, Giovanni: SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (2012)
  11. Palagi, Laura; Piccialli, Veronica; Rendl, Franz; Rinaldi, Giovanni; Wiegele, Angelika: Computational approaches to MAX-cut (2012)
  12. Wen, Zaiwen; Goldfarb, Donald; Scheinberg, Katya: Block coordinate descent methods for semidefinite programming (2012)
  13. Grippo, Luigi; Palagi, Laura; Piccialli, Veronica: An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (2011)
  14. Zhu, Yuntao; Zhang, Junshan; Partel, Kautilya: Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach (2011)
  15. de Klerk, Etienne: Exploiting special structure in semidefinite programming: a survey of theory and applications (2010)
  16. Ivanov, I. D.; de Klerk, E.: Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster (2010)
  17. Rendl, Franz; Rinaldi, Giovanni; Wiegele, Angelika: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (2010)
  18. Boyd, Stephen; Diaconis, Persi; Parrilo, Pablo; Xiao, Lin: Fastest mixing Markov chain on graphs with symmetries (2009)
  19. Jibrin, Shafiu; Boneh, Arnon; Van Ryzin, Jackie: Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints (2009)
  20. Leibfritz, F.; Maruhn, J. H.: A successive SDP-NSDP approach to a robust optimization problem in finance (2009)

1 2 3 4 next