Mathematical Programming

Mathematical Programming

ISSNs: 0025-5610

Additional searchable ISSN (electronic): 1436-4646

Springer, Germany

Scopus rating (2023): CiteScore 5.7 SJR 1.982 SNIP 2.117

Journal

Journal Metrics
1 - 17 out of 17Page size: 20

Research Output

  1. 2024

  2. Information complexity of mixed-integer convex optimization

    Basu, A., Jiang, H., Kerger, P. & Molinaro, M., 27 May 2024, (Online published) In: Mathematical Programming.

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Check@CityULib
  3. 2023

  4. Complexity of branch-and-bound and cutting planes in mixed-integer optimization

    Basu, A., Conforti, M., Di Summa, M. & Jiang, H., Mar 2023, In: Mathematical Programming. 198, 1, p. 787-810

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 16
    Check@CityULib

  5. Two-halfspace closure

    Basu, A. & Jiang, H., Jan 2023, In: Mathematical Programming. 197, 1, p. 411-426

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Check@CityULib
  6. 2021
  7. Published

    A smooth homotopy method for incomplete markets

    Zhan, Y. & Dang, C., Nov 2021, In: Mathematical Programming. 190, 1-2, p. 585–613

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 1
    Check@CityULib
  8. Published

    A differentiable homotopy method to compute perfect equilibria

    Chen, Y. & Dang, C., Jan 2021, In: Mathematical Programming. 185, 1-2, p. 77-109 33 p.

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 13
    Check@CityULib
  9. 2018

  10. SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices

    Jiang, R., Li, D. & Wu, B., Jun 2018, In: Mathematical Programming. 169, 2, p. 531-563

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 20
    Check@CityULib
  11. 2017
  12. Published

    An improved algorithm for the L2 – Lp minimization problem

    Ge, D., He, R. & He, S., Nov 2017, In: Mathematical Programming. 166, 1-2, p. 131-158

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 9
    Check@CityULib
  13. 2015
  14. Published

    Solving second-order conic systems with variable precision

    Cucker, F., Peña, J. & Roshchina, V., May 2015, In: Mathematical Programming. 150, 2, p. 217-250

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 3
    Check@CityULib
  15. 2014

  16. Intrinsic volumes of symmetric cones and applications in convex programming

    Amelunxen, D. & Bürgisser, P., 2014, In: Mathematical Programming. 149, 1-2, p. 105-130

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 18
    Check@CityULib
  17. 2012
  18. Published

    A FPTAS for computing a symmetric Leontief competitive economy equilibrium

    Zhu, Z., Dang, C. & Ye, Y., Feb 2012, In: Mathematical Programming. 131, 1-2, p. 113-129

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 9
    Check@CityULib

  19. Robust smoothed analysis of a condition number for linear programming

    Bürgisser, P. & Amelunxen, D., Feb 2012, In: Mathematical Programming. 131, 1-2, p. 221-251

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 4
    Check@CityULib
  20. 2011

  21. Convex relaxations for nonconvex quadratically constrained quadratic programming: Matrix cone decomposition and polyhedral approximation

    Zheng, X. J., Sun, X. L. & Li, D., Oct 2011, In: Mathematical Programming. 129, 2, p. 301-329

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 21
    Check@CityULib
  22. 2010
  23. Published

    Approximation algorithms for homogeneous polynomial optimization with quadratic constraints

    He, S., Li, Z. & Zhang, S., Oct 2010, In: Mathematical Programming. 125, 2, p. 353-383

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 77
    Check@CityULib
  24. 2004
  25. Published

    Solving linear programs with finite precision: I. Condition numbers and random programs

    Cheung, D. & Cucker, F., Jan 2004, In: Mathematical Programming. 99, 1, p. 175-196

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 10
    Check@CityULib
  26. 2001
  27. Published

    A new condition number for linear programming

    Cheung, D. & Cucker, F., Oct 2001, In: Mathematical Programming, Series B. 91, 1, p. 163-174

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 43
    Check@CityULib
  28. 1993

  29. The D2-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations

    Dang, C., Mar 1993, In: Mathematical Programming. 59, 1-3, p. 307-324

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 5
    Check@CityULib
  30. 1983

  31. On the average number of steps of the simplex method of linear programming

    Smale, S., Oct 1983, In: Mathematical Programming. 27, 3, p. 241-262

    Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

    Scopus citations: 135
    Check@CityULib