In this issue (25 articles)

1. 

   Full Length Paper

   On stress matrices of (d + 1)-lateration frameworks in general position

   A. Y. Alfakih, Nicole Taheri, Yinyu Ye Pages 1-17

   Look Inside Get Access

2. 

   Full Length Paper

   Generalized intersection cuts and a new cut generating paradigm

   Egon Balas, François Margot Pages 19-35

   Look Inside Get Access

3. 

   Full Length Paper

   Global error bounds for piecewise convex polynomials

   Guoyin Li Pages 37-64

   Look Inside Get Access

4. 

   Full Length Paper

   Algorithms for highly symmetric linear and integer programs

   Richard Bödi, Katrin Herr, Michael Joswig Pages 65-90

   Look Inside Get Access

5. 

   Full Length Paper

   Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods

   Hedy Attouch, Jérôme Bolte, Benar Fux Svaiter Pages 91-129

   Look Inside Get Access

6. 

   Full Length Paper

   Separating doubly nonnegative and completely positive matrices

   Hongbo Dong, Kurt Anstreicher Pages 131-153

   Look Inside Get Access

7. 

   Full Length Paper

   The effect of calmness on the solution set of systems of nonlinear equations

   Roger Behling, Alfredo Iusem Pages 155-165

   Look Inside Get Access

8. 

   Full Length Paper

   Distributionally robust joint chance constraints with second-order moment information

   Steve Zymler, Daniel Kuhn, Berç Rustem Pages 167-198

   Look Inside Get Access

9. 

   Full Length Paper

   A quasi-Newton strategy for the sSQP method for variational inequality and optimization problems

   Damián Fernández Pages 199-223

   Look Inside Get Access

10. 

    Full Length Paper

    An exact Jacobian SDP relaxation for polynomial optimization

    Jiawang Nie Pages 225-255

    Look Inside Get Access

11. 

    Full Length Paper

    Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints

    Tim Hoheisel, Christian Kanzow, Alexandra Schwartz Pages 257-288

    Look Inside Get Access

12. 

    Full Length Paper

    On the use of piecewise linear models in nonlinear programming

    Richard H. Byrd, Jorge Nocedal, Richard A. Waltz, Yuchen Wu Pages 289-324

    Look Inside Get Access

13. 

    Full Length Paper

    n-Fold integer programming in cubic time

    Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk Pages 325-341

    Look Inside Get Access

14. 

    Full Length Paper

    Separation and relaxation for cones of quadratic forms

    Samuel Burer, Hongbo Dong Pages 343-370

    Look Inside Get Access

15. 

    Full Length Paper

    Convex envelopes generated from finitely many compact convex sets

    Aida Khajavirad, Nikolaos V. Sahinidis Pages 371-408

    Look Inside Get Access

16. 

    Full Length Paper

    Improved lower bounds and exact algorithm for the capacitated arc routing problem

    Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte Pages 409-452

    Look Inside Get Access

17. 

    Full Length Paper

    NP-hardness of deciding convexity of quartic polynomials and related problems

    Amir Ali Ahmadi, Alex Olshevsky, Pablo A. Parrilo… Pages 453-476

    Look Inside Get Access

18. 

    Full Length Paper

    On the global convergence of a generalized iterative procedure for the minisum location problem with ℓ _p distances for p > 2

    A. M. Rodríguez-Chía, C. Valero-Franco Pages 477-502

    Look Inside Get Access

19. 

    Full Length Paper

    Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees

    Hiroshi Hirai Pages 503-530

    Look Inside Get Access

20. 

    Full Length Paper

    An exact algorithm for graph partitioning

    William W. Hager, Dzung T. Phan, Hongchao Zhang Pages 531-556

    Look Inside Get Access