Results 1 to 10 of about 551,553 (240)

Learning Data Manifolds with a Cutting Plane Method [PDF]

open access: greenNeural Computation, 2018
We consider the problem of classifying data manifolds where each manifold represents invariances that are parameterized by continuous degrees of freedom. Conventional data augmentation methods rely on sampling large numbers of training examples from these manifolds.
SueYeon Chung   +3 more
semanticscholar   +7 more sources

Cutting Plane Based Cylinder Fitting Method With Incomplete Point Cloud Data for Digital Fringe Projection [PDF]

open access: goldIEEE Access, 2020
Benefiting from the characteristics of full field scanning, high resolution and high precision, digital fringe projection measurement technology has been widely used in three-dimensional measurement.
Changzhi Yu, Fang Ji, Junpeng Xue
doaj   +3 more sources

Multiple Cuts in the Analytic Center Cutting Plane Method

open access: greenSIAM Journal on Optimization, 1998
Summary: We analyze the multiple cut generation scheme in the analytic center cutting plane method. We propose an optimal primal and dual updating direction when the cuts are central. The direction is optimal in the sense that it maximizes the product of the new dual slacks and of the new primal variables within the trust regions defined by Dikin's ...
Jean‐Louis Goffin, Jean-Philippe Vial
semanticscholar   +4 more sources

Revisiting a Cutting-Plane Method for Perfect Matchings [PDF]

open access: yesOpen Journal of Mathematical Optimization, 2020
In 2016, Chandrasekaran, Végh, and Vempala (Mathematics of Operations Research, 41(1):23–48) published a method to solve the minimum-cost perfect matching problem on an arbitrary graph by solving a strictly polynomial number of linear programs.
Chen, Amber Q.   +3 more
doaj   +4 more sources

AN ANALYSIS OF GOMORY CUTTING PLANE METHOD APPLICATION IN THE OPTIMIZATION OF PRODUCTION PROFIT: A CASE STUDY OF GRIYA BATIK NOTONEGORO JEMBER

open access: diamondBarekeng, 2023
Gomory cutting plane method is one of the methods in linear programming that is needed to solve integer programming when the decision obtained is in the form of fractions with the addition of constraint known as gomory constraint.
Girlyas Rasta Yunta   +2 more
doaj   +3 more sources

Analytic center cutting plane methods for variational inequalities over convex bodies [PDF]

open access: goldJournal of Inequalities and Applications, 2018
An analytic center cutting plane method is an iterative algorithm based on the computation of analytic centers. In this paper, we propose some analytic center cutting plane methods for solving quasimonotone or pseudomonotone variational inequalities ...
Renying Zeng
doaj   +2 more sources

An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications [PDF]

open access: greenSymposium on the Theory of Computing, 2020
Given a separation oracle for a convex set K ⊂ ℝ n that is contained in a box of radius R, the goal is to either compute a point in K or prove that K does not contain a ball of radius є.
Haotian Jiang   +3 more
openalex   +3 more sources

An optimal variant of Kelley’s cutting-plane method [PDF]

open access: yesMathematical Programming, 2016
We propose a new variant of Kelley's cutting-plane method for minimizing a nonsmooth convex Lipschitz-continuous function over the Euclidean space. We derive the method through a constructive approach and prove that it attains the optimal rate of convergence for this class of problems.
Drori, Yoel, Teboulle, Marc
openaire   +5 more sources

A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method

open access: goldInternational Conference on Enterprise Information Systems, 2013
One of the important seaside operations problems that received a lot of attention in the literature is the assignment of quay space and service time to vessels that have to be unloaded and loaded at a terminal. This problem is commonly referred to as the
Ahmed Simrin   +2 more
openalex   +2 more sources

A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization [PDF]

open access: greenIEEE Annual Symposium on Foundations of Computer Science, 2015
In this paper we improve upon the running time for finding a point in a convex set given a separation oracle. In particular, given a separation oracle for a convex set K ⊂ Rn that is contained in a box of radius R we show how to either compute a point in
Yin Tat Lee   +2 more
openalex   +2 more sources

Home - About - Disclaimer - Privacy