Results 301 to 310 of about 837,325 (362)
Some of the next articles are maybe not open access.
Cutting-Plane Theory: Disjunctive Methods
1977This paper is a survey, with new results, of the disjunctive methods of cutting-plane theory, which were devised by Balas, Glover, Owen, Young, and other researchers, over the past half decade. The basic disjunctive cut principle is derived, its interrelations with the other cut-producing procedures are discussed, and applications of it are given. Many
openaire +1 more source
A cutting plane method and a parallel algorithm for packing rectangles in a circular container
European Journal of Operational Research, 2022Allyson Silva +3 more
semanticscholar +1 more source
Interior Proximal Method Without the Cutting Plane Property
Journal of Optimization Theory and Applications, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A Cutting method for finding discrete minimax with dropping of cutting planes
Lobachevskii Journal of Mathematics, 2014Cutting algorithms with partial embedding of the admissible set and with periodical dropping of planes are commonly used in solving conditional minimization problems. The authors extend the implementation to cutting methods that do not approximate the feasible set, but the epigraph of the objective function. The proposed method provides the possibility
Zabotin I., Yarullin R.
openaire +3 more sources
A Cutting Plane Method for Solving Quasimonotone Variational Inequalities
Computational Optimization and Applications, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcotte, P., Zhu, D. L.
openaire +1 more source
Accelerating the Cutting Plane Method for Nonlinear Programming
Journal of the Society for Industrial and Applied Mathematics, 1961The “cutting plane” method of Kelley for nonlinear programming problems applies linear programming, through a sequence of local linearizations, to the problem of minimizing a convex function of real variables subject to linear inequality constraints.
openaire +1 more source
Distributed Cutting Plane Method via Sample Point Consensus
IEEE Transactions on Automatic ControlThis paper considers a general setup for the constrained convex optimisation problem over jointly-fully connected time-varying networks. We propose a novel cutting plane-based method that embeds a proximity-based consensus scheme for solving this (potentially non-smooth) optimisation problem.
Tianyi Zhong, David Angeli
openaire +2 more sources
Cutting Plane Method for Continuously Constrained Kernel-Based Regression
IEEE Transactions on Neural Networks, 2010Incorporating constraints into the kernel-based regression is an effective means to improve regression performance. Nevertheless, in many applications, the constraints are continuous with respect to some parameters so that computational difficulties arise. Discretizing the constraints is a reasonable solution for these difficulties.
Zhe, Sun +3 more
openaire +2 more sources
A cutting plane method for knapsack polytope
Journal of Computer and Systems Sciences International, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source