ACCPM is a package for solving large scale convex optimization problems. The code is an implementation of the cutting plane method. Instead of solving every relaxed master problem to optimality (as is the case in classical decomposition approaches), ACCPM looks for an analytic center of the current localization set. The projective algorithm is successfully applied for this purpose.

References in zbMATH (referenced in 59 articles )

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

1 2 3 next

  1. Bettiol, Enrico; Létocart, Lucas; Rinaldi, Francesco; Traversi, Emiliano: A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (2020)
  2. Berthold, Timo; Perregaard, Michael; Mészáros, Csaba: Four good reasons to use an interior point solver within a MIP solver (2018)
  3. Kim, Kibaek; Zavala, Victor M.: Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (2018)
  4. Antoniuk, Kostiantyn; Franc, Vojtěch; Hlaváč, Václav: V-shaped interval insensitive loss for ordinal classification (2016)
  5. Clautiaux, François; Alves, Cláudio; Valério de Carvalho, José; Rietz, Jürgen: New stabilization procedures for the cutting stock problem (2011)
  6. Moungla, Nora Touati; Létocart, L.; Nagih, A.: Solutions diversification in a column generation algorithm (2010)
  7. Mutapcic, Almir; Boyd, Stephen: Cutting-set methods for robust convex optimization with pessimizing oracles (2009)
  8. Peng, Yehui; Feng, Heying; Li, Qiyong: A filter-variable-metric method for nonsmooth convex constrained optimization (2009)
  9. Bravo, J. M.; Alamo, T.; Redondo, M. J.; Camacho, E. F.: An algorithm for bounded-error identification of nonlinear systems based on DC functions (2008)
  10. Shida, Masayuki: An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming (2008)
  11. Wallin, Ragnar; Kao, Chung-Yao; Hansson, Anders: A cutting plane method for solving KYP-SDPs (2008)
  12. Ben-Ameur, Walid; Neto, José: Acceleration of cutting-plane and column generation algorithms: applications to network design (2007)
  13. Grant, Michael; Boyd, Stephen; Ye, Yinyu: Disciplined convex programming (2006)
  14. Peng, Yehui; Liu, Zhenhai: A variable metric method for nonsmooth convex constrained optimization (2006)
  15. Tran Van Hoai; Reinelt, Gerhard; Bock, Hans Georg: BoxStep methods for crew pairing problems (2006)
  16. Klose, Andreas; Drexl, Andreas: Lower bounds for the capacitated facility location problem based on column generation (2005)
  17. Krishnan, Kartik; Terlaky, Tamás: Interior point and semidefinite approaches in combinatorial optimization (2005)
  18. Mitchell, J. E.; Ramaswamy, S.: Using selective orthonormalization to update the analytic center after addition of multiple cuts (2005)
  19. Tran Van Hoai: Solving large scale crew pairing problems. (2005)
  20. Ding, Xiaoying; Wang, Xifan; Song, Y. H.: Interior point cutting plane method for optimal power flow (2004)

1 2 3 next