The Cutting Plane Method Is Polynomial for Perfect Matchings [PDF]
The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several authors over past decades. Its convergence has been an open question. We develop a cutting plane algorithm that converges in polynomial-time using only Edmonds’ blossom inequalities, and which maintains half-integral intermediate LP solutions supported ...
Chandrasekaran, Karthekeyan +2 more
semanticscholar +9 more sources
A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems [PDF]
The authors consider the problem of finding a point in a nonempty bounded convex body in the cone of symmetric positive semidefinite matrices. A multiple-cut analytic center cutting plane algorithm is presented. Starting from a trivial initial point, the algorithm generates a sequence of positive definite matrices which are approximate analytic centers
Kim-Chuan Toh, Gongyun Zhao, Jie Sun
core +6 more sources
Cutting-plane methods witout nested approximating sets [PDF]
In connection with the needs of solving optimization problems, the development of conditional minimization methods with convenient numerical implementation continues to attract the attention of mathematicians. In this monograph we propose methods for solving mathematical programming problems that belong to the class of cutting methods.
I. Ya. Zabotin, Rashid Yarullin
openalex +3 more sources
Research on a Rapid Image Stitching Method for Tunneling Front Based on Navigation and Positioning Information [PDF]
To address the challenges posed by significant parallax, dynamic changes in monitoring camera positions, and the need for rapid wide-field image stitching in underground coal mine tunneling faces, this paper proposes a fast image stitching method for ...
Hongda Zhu, Sihai Zhao
doaj +2 more sources
Incremental cutting-plane method and its application [PDF]
We consider regularized cutting-plane methods to minimize a convex function that is the sum of a large number of component functions. One important example is the dual problem obtained from Lagrangian relaxation on a decomposable problem. In this paper, we focus on an incremental variant of the regularized cutting-plane methods, which only evaluates a ...
Nagisa Sugishita +2 more
openalex +3 more sources
Smooth Ranking SVM via Cutting-Plane Method [PDF]
The most popular classification algorithms are designed to maximize classification accuracy during training. However, this strategy may fail in the presence of class imbalance since it is possible to train models with high accuracy by overfitting to the majority class. On the other hand, the Area Under the Curve (AUC) is a widely used metric to compare
Erhan Can Ozcan +3 more
openalex +3 more sources
Exact Penalization, Level Function Method, and Modified Cutting-Plane Method for Stochastic Programs with Second Order Stochastic Dominance Constraints [PDF]
Level function methods and cutting plane methods have been recently proposed to solve stochastic programs with stochastic second order dominance (SSD) constraints.
Hailin Sun +3 more
semanticscholar +4 more sources
An Exact Cutting Plane Method for $k$-submodular Function Maximization [PDF]
Qimeng Yu, Si̇mge Küçükyavuz
openalex +2 more sources
Using projected cutting planes in the extended cutting plane method [PDF]
In this paper we show that simple projections can improve the algorithmic performance of cutting plane-based optimization methods.
Westerlund Tapio +2 more
openaire +2 more sources
A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method [PDF]
We propose a cutting-plane approach (namely, Benders decomposition) for a class of capacitated multi-period facility location problems. The novelty of this approach lies on the use of a specialized interior-point method for solving the Benders ...
J. Castro +2 more
semanticscholar +7 more sources

