MP - 2021 - volume 190 论文列表 |
| 点击这里查看 Mathematical Programming 的JCR分区、影响因子等信息 |
Volume 190, Number 1, November 2021
Andreas Potschka Hans Georg Bock
Further results on an abstract model for branching and its application to mixed integer programming.Daniel Anderson Pierre Le Bodic Kerri Morgan
Connecting optimization with spectral analysis of tri-diagonal matrices. A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models.Niels van der Laan Ward Romeijnders
A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian.Dmitriy Kunisky Afonso S. Bandeira
Statistical robustness in utility preference robust optimization models. Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup.Yun Kuen Cheung Richard Cole Yixin Tao
A smooth homotopy method for incomplete markets. Determination of convex functions via subgradients of minimal norm.Pedro Pérez-Aros David Salas Emilio Vilches
Computation and efficiency of potential function minimizers of combinatorial congestion games. Prophet secretary through blind strategies.José R. Correa Raimundo Saona Bruno Ziliotto
Strengthening convex relaxations of 0/1-sets using Boolean formulas.Samuel Fiorini Tony Huynh Stefan Weltge
A new framework to relax composite functions in nonlinear programs. Generalized Chvátal-Gomory closures for integer programs with bounds on variables.Sanjeeb Dash Oktay Günlük Dabeen Lee
Quasi-Monte Carlo methods for two-stage stochastic mixed-integer programs. The sum-of-squares hierarchy on the sphere and applications in quantum information theory. Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization. Existence of efficient and properly efficient solutions to problems of constrained vector optimization.Do Sang Kim Boris S. Mordukhovich Tien Son Pham Nguyen Van Tuyen
On the linear convergence rates of exchange and continuous methods for total variation minimization.Axel Flinth Frédéric de Gournay Pierre Weiss
Discrete optimization methods for group model selection in compressed sensing.Bubacarr Bah Jannis Kurtz Oliver Schaudt
Finding and verifying the nucleolus of cooperative games.Márton Benedek Jörg Fliege Tri-Dung Nguyen
Decomposition of arrow type positive semidefinite matrices with application to topology optimization. Correction to: A scaling algorithm for optimizing arbitrary functions over vertices of polytopes. A scaling algorithm for optimizing arbitrary functions over vertices of polytopes. Accelerated proximal point method for maximally monotone operators. Bi-perspective functions for mixed-integer fractional programs with indicator variables. On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling.