Mathematical programming

Keyphrases

Publications

volume 207, number 1-2, 2023

Federica Cecchetto, Vera Traub, Rico Zenklusen
Better-than- 4 3 -approximations for leaf-to-leaf tree and connectivity augmentation. Mathematical programming 207 (1-2) (2023)

volume 206, number 1-2, 2023

Elisabeth Gaar, Jon Lee, Ivana Ljubić, Markus Sinnl, Kübra Tanınmış
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. Mathematical programming 206 (1-2) (2023)

volume 204, number 1-2, 2023

Nikita Doikov, Yurii Nesterov
Gradient regularization of Newton method with Bregman distances. Mathematical programming 204 (1-2) (2023)
Fedor V Fomin, Petr A Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse collections in matroids and graphs. Mathematical programming 204 (1-2) (2023)
Nikita Doikov, Yurii Nesterov
Gradient regularization of Newton method with Bregman distances. Mathematical programming 204 (1-2) (2023)

volume 203, number 1-2, 2023

Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner
Phragmén's voting methods and justified representation. Mathematical programming 203 (1-2) (2023)

volume 203, number 1-2, 2022

Ioannis Caragiannis, Aris Filos-Ratsikas, Swaprava Nath, Alexandros A Voudouris
Truthful ownership transfer with expert advice. Mathematical programming 203 (1-2) (2022)

volume 200, number 1, 2022

Radu Ioan Boț, Ernö Robert Csetnek, Dang-Khoa Nguyen
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates. Mathematical programming 200 (1) (2022)
Hao Hu, Renata Sotirov, Henry Wolkowicz
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs. Mathematical programming 200 (1) (2022)

volume 199, number 1-2, 2022

Anton Rodomanov, Yurii Nesterov
Subgradient ellipsoid method for nonsmooth convex problems. Mathematical programming 199 (1-2) (2022)

volume 198, number 1, 2022

Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
A duality based 2-approximation algorithm for maximum agreement forest. Mathematical programming 198 (1) (2022)
Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
A duality based 2-approximation algorithm for maximum agreement forest. Mathematical programming 198 (1) (2022)

volume 197, number 2, 2022

Paritosh Garg, Linus Jordan, Ola Svensson
Semi-streaming algorithms for submodular matroid intersection. Mathematical programming 197 (2) (2022)

volume 193, number 2, 2022

Boaz Barak, Ankur Moitra
Noisy tensor completion via the sum-of-squares hierarchy. Mathematical programming 193 (2) (2022)

2021

Antoine Lagarde, Tristan Tomala
Optimality and fairness of partisan gerrymandering. Mathematical programming (2021)

volume 194, number 1-2, 2021

Stefan Lendl, Britta Peis, Veerle Timmermans
Matroid bases with cardinality constraints on the intersection. Mathematical programming 194 (1-2) (2021)
Gennadiy Averkov, Matthias Schymura
Complexity of linear relaxations in integer programming. Mathematical programming 194 (1-2) (2021)

volume 193, number 1, 2021

Nikita Doikov, Yurii Nesterov
Local convergence of tensor methods. Mathematical programming 193 (1) (2021)

volume 192, number 1-2, 2021

Tim A Hartmann, Stefan Lendl, Gerhard J Woeginger
Continuous facility location on graphs. Mathematical programming 192 (1-2) (2021)
Kim-Manuel Klein
About the complexity of two-stage stochastic IPs. Mathematical programming 192 (1-2) (2021)
Xinrui Jia, Kshiteej Sheth, Ola Svensson
Fair colorful k -center clustering. Mathematical programming 192 (1-2) (2021)
Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
A technique for obtaining true approximations for k -center with covering constraints. Mathematical programming 192 (1-2) (2021)

volume 192, number 1-2, 2020

Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee
Idealness of k -wise intersecting families. Mathematical programming 192 (1-2) (2020)

volume 191, number 2, 2020

Evan DeCorte, Fernando Mário de Oliveira Filho, Frank Vallentin
Complete positivity and distance-avoiding sets. Mathematical programming 191 (2) (2020)
Simon Bruggmann, Rico Zenklusen
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint. Mathematical programming 191 (2) (2020)

volume 190, number 1-2, 2020

Samuel Fiorini, Tony Huynh, Stefan Weltge
Strengthening convex relaxations of 0/1-sets using Boolean formulas. Mathematical programming 190 (1-2) (2020)

volume 189, number 1-2, 2020

Radu Ioan Boț, Ernö Robert Csetnek, Szilárd Csaba László
Tikhonov regularization of a second order dynamical system with Hessian driven damping. Mathematical programming 189 (1-2) (2020)

volume 188, number 1, 2020

Robert M Gower, Peter Richtárik, Francis Bach
Stochastic quasi-gradient methods: variance reduction via Jacobian sketching. Mathematical programming 188 (1) (2020)

volume 183, number 1, 2020

Elisabeth Gaar, Franz Rendl
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. Mathematical programming 183 (1) (2020)
Zhuan Khye Koh, Laura Sanità
An efficient characterization of submodular spanning tree games. Mathematical programming 183 (1) (2020)

volume 186, number 1, 2019

Yurii Nesterov
Implementable tensor methods in unconstrained convex optimization. Mathematical programming 186 (1) (2019)

volume 176, number 1-2, 2019

Yuxin Chen, Yuejie Chi, Jianqing Fan, Cong Ma
Gradient Descent with Random Initialization: Fast Global Convergence for Nonconvex Phase Retrieval. Mathematical programming 176 (1-2) (2019)
Chengde Qian, Quoc Tran-Dinh, Sheng Fu, Changliang Zou, Yufeng Liu
Robust Multicategory Support Matrix Machines. Mathematical programming 176 (1-2) (2019)

volume 181, number 2, 2018

Mathias Pohl, Alexander Ristig, Walter Schachermayer, Ludovic Tangpi
Theoretical and empirical analysis of trading activity. Mathematical programming 181 (2) (2018)

volume 178, number 1, 2018

Sebastian Banert, Radu Ioan Boț
A general double-proximal gradient algorithm for d.c. programming. Mathematical programming 178 (1) (2018)

volume 170, number 1, 2018

Sander Gribling, David de Laat, Monique Laurent
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. Mathematical programming 170 (1) (2018)

volume 78, number 1-2, 2018

Hongcheng Liu, Xue Wang, Tao Yao, Runze Li, Yinyu Ye
Sample Average Approximation with Sparsity-Inducing Penalty for High-Dimensional Stochastic Programming. Mathematical programming 78 (1-2) (2018)

volume 173, number 1, 2017

Boris Houska, Benoît Chachuat
Global optimization in Hilbert space. Mathematical programming 173 (1) (2017)

volume 171, number 1, 2017

Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
New algorithms for maximum disjoint paths based on tree-likeness. Mathematical programming 171 (1) (2017)

volume 170, number 2, 2017

Ahmadreza Marandi, Dick den Hertog
When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent? Mathematical programming 170 (2) (2017)

volume 169, number 1, 2017

Chong Zhang, Minh Pham, Sheng Fu, Yufeng Liu
Robust Multicategory Support Vector Machines using Difference Convex Algorithm. Mathematical programming 169 (1) (2017)

volume 166, number 1-2, 2017

Hongcheng Liu, Tao Yao, Runze Li, Yinyu Ye
Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. Mathematical programming 166 (1-2) (2017)

volume 160, number 1, 2016

Afonso S Bandeira, Christopher Kennedy, Amit Singer
Approximating the Little Grothendieck Problem over the Orthogonal and Unitary Groups. Mathematical programming 160 (1) (2016)

volume 159, number 1, 2015

Donghwan Kim, Jeffrey A Fessler
Optimized first-order methods for smooth convex minimization. Mathematical programming 159 (1) (2015)