Mathematical Programming Computation

SCIE-ISI SCOPUS (2009-2025)

  1867-2949

  1867-2957

  Đức

 

Cơ quản chủ quản:  Springer Verlag , Springer Heidelberg

Lĩnh vực:
SoftwareTheoretical Computer Science

Phân tích ảnh hưởng

Các bài báo tiêu biểu

Pyomo: modeling and solving mathematical programs in Python
- 2011
William E. Hart, Jean‐Paul Watson, David L. Woodruff
Efficient block-coordinate descent algorithms for the Group Lasso
Tập 5 Số 2 - Trang 143-169 - 2013
Zhiwei Qin, Katya Scheinberg, Donald Goldfarb
Maximum-weight stable sets and safe lower bounds for graph coloring
- 2012
Stephan Held, William J. Cook, Edward C. Sewell
Alternating proximal gradient method for sparse nonnegative Tucker decomposition
Tập 7 Số 1 - Trang 39-70 - 2015
Yangyang Xu
On solving trust-region and other regularised subproblems in optimization
- 2010
Nicholas I. M. Gould, Daniel N. Robinson, HS Thorne
QPLIB: a library of quadratic programming instances
Tập 11 Số 2 - Trang 237-265 - 2019
Fabio Furini, Egidio Traversi, Pietro Belotti, Antonio Frangioni, Ambros Gleixner, Nicholas I. M. Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans D. Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele
On fast trust region methods for quadratic models with linear constraints
Tập 7 Số 3 - Trang 237-267 - 2015
M. J. D. Powell
Abstract Quadratic models $$Q_k ( \underline{x}), \underline{x}\in \mathcal{R}^n$$ Q k ( x ̲ ) , x ̲ ∈ R n , of the objective function $$F ( \underline{x}), \underline{x}\in \mathcal{R}^n$$ F ( x ̲ ) , x ̲ ∈ R n , are used by many successful iterative algorithms for minimization, where k is the iteration number. Given the vector of variables $$\underline{x}_k \in \mathcal{R}^n$$ x ̲ k ∈ R n , a ne... hiện toàn bộ
On optimizing over lift-and-project closures
Tập 4 Số 2 - Trang 151-179 - 2012
Pierre Bonami