cutting plane method

Learning to Remove Cuts in Integer Linear Programming ICML 2024 Robust Beamforming for Downlink Multi-Cell Systems: A Bilevel Optimization Perspective AAAI 2024 Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes NeurIPS 2024 Efficient Convex Optimization Requires Superlinear Memory (Extended Abstract) IJCAI 2023 Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal COLT 2023 Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity NeurIPS 2022 Efficient Convex Optimization Requires Superlinear Memory COLT 2022 Solving Large-Scale Sparse PCA to Certifiable (Near) Optimality JMLR 2022 Wasserstein Logistic Regression with Mixed Features NeurIPS 2022 Reinforcement Learning for Integer Programming: Learning to Cut ICML 2020 Cutting plane methods can be extended into nonconvex optimization COLT 2018 Limited Memory Kelley's Method Converges for Composite Convex and Submodular Objectives NeurIPS 2018 Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning NeurIPS 2014 Robust Regression on MapReduce ICML 2013 Regularized Bundle Methods for Convex and Non-Convex Risks JMLR 2012 Smoothing Multivariate Performance Measures JMLR 2012 Multiple Instance Learning on Structured Data NeurIPS 2011 Lower Bounds on Rate of Convergence of Cutting Plane Methods NeurIPS 2010 Submodularity Cuts and Applications NeurIPS 2009 Support Vector Machine Classification with Indefinite Kernels NeurIPS 2007