User menu

Barrier subgradient method

Bibliographic reference Nesterov, Yurii. Barrier subgradient method. In: Mathematical Programming, Vol. 127, no. 1, p. 31-56 (2011)
Permanent URL
  1. d'Aspremont Alexandre, Banerjee Onureena, El Ghaoui Laurent, First-Order Methods for Sparse Covariance Selection, 10.1137/060670985
  2. Bienstock D.: Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice. Springer, NY (2002)
  3. Grigoriadis Michael D., Khachiyan Leonid G., Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints, 10.1137/0804004
  4. Grigoriadis M.D., Khachiyan L.G.: Approximate minimum-cost multicommodity flows. Math. Program. 75, 477–482 (1996)
  5. Nemirovski Arkadi, Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems, 10.1137/s1052623403425629
  6. Nemirovsky A., Yudin D.: Problem Complexity and Method Efficiency in Optimization. Wiley, NY (1983)
  7. Nesterov Yu, Semidefinite relaxation and nonconvex quadratic optimization, 10.1080/10556789808805690
  8. Nesterov Yurii, Introductory Lectures on Convex Optimization, ISBN:9781461346913, 10.1007/978-1-4419-8853-9
  9. Nesterov Yu., Smooth minimization of non-smooth functions, 10.1007/s10107-004-0552-5
  10. Nesterov Yu., Excessive Gap Technique in Nonsmooth Convex Minimization, 10.1137/s1052623403422285
  11. Nesterov Yurii, Dual extrapolation and its applications to solving variational inequalities and related problems, 10.1007/s10107-006-0034-z
  12. Nesterov Yurii, Smoothing Technique and its Applications in Semidefinite Optimization, 10.1007/s10107-006-0001-8
  13. Mordukhovich B. S., Characterizations of linear suboptimality for mathematical programs with equilibrium constraints, 10.1007/s10107-007-0150-4
  14. Nesterov, Yu.: Gradient methods for minimizing composite objective function. CORE Discussion Paper 2007/76 (2007)
  15. Nesterov Yu., Rounding of convex sets and efficient gradient methods for linear programming problems, 10.1080/10556780701550059
  16. Nesterov Yurii, Nemirovskii Arkadii, Interior-Point Polynomial Algorithms in Convex Programming, ISBN:9780898713190, 10.1137/1.9781611970791
  17. Nesterov Yu., Todd M.J., Ye Y.: Infeasible-start primal-dual methods and infeasibility detectors. Math. Program. 84(2), 227–267 (1999)
  18. Plotkin Serge A., Shmoys David B., Tardos Éva, Fast Approximation Algorithms for Fractional Packing and Covering Problems, 10.1287/moor.20.2.257
  19. Shahrokhi Farhad, Matula D. W., The maximum concurrent flow problem, 10.1145/77600.77620