Journal: Math. Program.

Volume 153, Issue 2

275 -- 288Walter D. Morris Jr.. Efficient computation of a canonical form for a matrix with the generalized P-property
289 -- 308Tim Carnes, David B. Shmoys. Primal-dual schema for capacitated covering problems
309 -- 331James Saunderson, Pablo A. Parrilo. Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones
333 -- 362Guoyin Li, Boris S. Mordukhovich, T. S. Pham. New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
363 -- 380Richard A. Tapia. On averaging and representation properties of the BFGS and related secant updates
381 -- 415James R. Lee, Manor Mendel, Mohammad Moharrami. A node-capacitated Okamura-Seymour theorem
417 -- 458Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya Razenshteyn, Renato F. Werneck. An exact combinatorial algorithm for minimum graph bisection
459 -- 493Tsvetan Asamov, Andrzej Ruszczynski. Time-consistent approximations of risk-averse multistage stochastic optimization problems
495 -- 534Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich. Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
535 -- 575Bo Jiang, Yu-Hong Dai. A framework of constraint preserving update schemes for optimization on Stiefel manifold
577 -- 594Dimitris Bertsimas, Hoda Bidkhori. On the performance of affine policies for two-stage adaptive optimization: a geometric perspective
595 -- 633Dimitris Bertsimas, Vishal Gupta, Ioannis Ch. Paschalidis. Data-driven estimation in equilibrium using inverse optimization
635 -- 653Dmitriy Drusvyatskiy, Alexander D. Ioffe. Quadratic growth and critical point stability of semi-algebraic functions
655 -- 685Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa. A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems
687 -- 713Sergei Chubanov. A polynomial projection algorithm for linear feasibility problems
715 -- 722Bingsheng He, Xiaoming Yuan. On the convergence rate of Douglas-Rachford operator splitting method
723 -- 725Martin E. Dyer, Leen Stougie. Erratum to: Computational complexity of stochastic programming problems

Volume 153, Issue 1

1 -- 3Volker Kaibel, Rekha R. Thomas. Lifts of convex sets in optimization
5 -- 11Michel X. Goemans. Smallest compact formulation for the permutahedron
13 -- 39Michele Conforti, Bert Gerards, Kanstantsin Pashkovich. Stable sets and graphs with no even holes
41 -- 66Hamza Fawzi, Pablo A. Parrilo. Lower bounds on nonnegative rank via nonnegative nuclear norms
67 -- 74Yaroslav Shitov. Tropical lower bounds for extended formulations
75 -- 94Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary. Extended formulations, nonnegative factorizations, and randomized communication protocols
95 -- 115David Avis, Hans Raj Tiwary. On the extension complexity of combinatorial polytopes
117 -- 131Samuel Fiorini, Kanstantsin Pashkovich. Uncapacitated flow-based extended formulations
133 -- 177Hamza Fawzi, João Gouveia, Pablo A. Parrilo, Richard Z. Robinson, Rekha R. Thomas. Positive semidefinite rank
179 -- 199Jop Briët, Daniel Dadush, Sebastian Pokutta. On the existence of 0/1 polytopes with high semidefinite extension complexity
201 -- 212João Gouveia, Richard Z. Robinson, Rekha R. Thomas. Worst-case results for positive semidefinite rank
213 -- 221Tim Netzer, Raman Sanyal. Smooth hyperbolicity cones are spectrahedral shadows
223 -- 245Mario Kummer, Daniel Plaumann, Cynthia Vinzant. Hyperbolic polynomials, interlacers, and sums of squares
247 -- 274Jiawang Nie. Linear optimization with cones of moments and nonnegative polynomials