


default search action
Mathematical Programming Computation, Volume 7
Volume 7, Number 1, March 2015
- Xiaowei Bao, Aida Khajavirad, Nikolaos V. Sahinidis
, Mohit Tawarmalani
:
Global optimization of nonconvex problems with multilinear intermediates. 1-37 - Yangyang Xu:
Alternating proximal gradient method for sparse nonnegative Tucker decomposition. 39-70 - Philip E. Gill, Elizabeth Wong:
Methods for convex and general quadratic programming. 71-112
Volume 7, Number 2, June 2015
- Quentin Louveaux, Laurent Poirrier, Domenico Salvagnin:
The strength of multi-row models. 113-148 - Ethan X. Fang, Bingsheng He, Han Liu, Xiaoming Yuan
:
Generalized alternating direction method of multipliers: new theoretical insights and applications. 149-187 - Andreas Bärmann, Frauke Liers
, Alexander Martin
, Maximilian Merkert
, Christoph Thurner, Dieter Weninger:
Solving network design problems via iterative aggregation. 189-217 - Hans D. Mittelmann, Domenico Salvagnin:
On solving a hard quadratic 3-dimensional assignment problem. 219-234
Volume 7, Number 3, September 2015
- Daniel Bienstock, Philip E. Gill, Nicholas I. M. Gould
:
A note on "On fast trust region methods for quadratic models with linear constraints", by Michael J.D. Powell. 235 - M. J. D. Powell:
On fast trust region methods for quadratic models with linear constraints. 237-267 - Keld Helsgaun:
Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun Algorithm. 269-287 - Janick V. Frasch, Sebastian Sager, Moritz Diehl:
A parallel quadratic programming method for dynamic optimization problems. 289-329 - Liuqin Yang, Defeng Sun
, Kim-Chuan Toh:
SDPNAL \(+\) : a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. 331-366
Volume 7, Number 4, December 2015
- Gerald Gamrath
, Thorsten Koch
, Alexander Martin
, Matthias Miltenberger
, Dieter Weninger:
Progress in presolving for mixed integer programming. 367-398 - Frank E. Curtis
, Xiaocun Que:
A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees. 399-428 - Jonathan Eckstein
, William E. Hart, Cynthia A. Phillips:
PEBBL: an object-oriented framework for scalable parallel branch and bound. 429-469 - Tanisha G. Cotton, Lewis Ntaimo:
Computational study of decomposition algorithms for mean-risk stochastic linear programs. 471-499

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.