Results 1 to 10 of about 1,171,807 (293)

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

Journal 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

Using projected cutting planes in the extended cutting plane method [PDF]

Optimization, 2021
In this paper we show that simple projections can improve the algorithmic performance of cutting plane-based optimization methods.
Westerlund Tapio, Eronen Ville-Pekka, Mäkelä Marko M   +2 more
openaire   +4 more sources

Laser-Assisted Diamond Turning for Anisotropy Suppression in Calcium Fluoride [PDF]

Micromachines
This paper proposes the use of laser-assisted cutting technology to control the brittle–plastic transition of single-crystal CaF2 through local thermal softening, thereby suppressing its processing anisotropy.
Enbo Xing, Jinsong Xue, Rongbiao Yang, Mingyue Wang, Huimin Zhou, Guohui Xing, Jianglong Li, Jiamin Rong, Huanfei Wen, Jun Tang, Jun Liu   +10 more
doaj   +2 more sources

Anisotropic micro cutting of rolled titanium alloy

Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2023
In machining of rolled titanium alloy, the anisotropy in the cutting force induced by the rolling texture should be controlled to achieve high quality surface.
Shoichi TAMURA, Tetsushi KABURAGI, Yuichiro KAMAKOSHI, Takashi MATSUMURA   +3 more
doaj   +1 more source

Split Cuts in the Plane

SIAM Journal on Optimization, 2021
We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.
Basu A., Conforti M., Di Summa M., Jiang H.   +3 more
openaire   +3 more sources

Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems

Algorithms, 2023
The Bundle Enrichment Method (BEM-DC) is introduced for solving nonsmooth difference of convex (DC) programming problems. The novelty of the method consists of the dynamic management of the bundle.
Manlio Gaudioso, Sona Taheri, Adil M. Bagirov, Napsu Karmitsa   +3 more
doaj   +1 more source

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

IEEE 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   +1 more source

Understanding cutting planes for QBFs [PDF]

Information and Computation, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla   +3 more
openaire   +7 more sources

ℓ_q-Norm Sample-Adaptive Multiple Kernel Learning

IEEE Access, 2020
Existing multiple kernel learning (MKL) algorithms indiscriminately apply the same set of kernel combination weights to all samples by pre-specifying a group of base kernels.
Qiang Wang, Xinwang Liu, Jiaqing Xu
doaj   +1 more source

Preprocessing and cutting planes with conflict graphs [PDF]

Computers & Operations Research, 2021
This paper addresses the development of conflict graph-based algorithms and data structures into the COIN-OR Branch-and-Cut (CBC) solver, including: $(i)$ an efficient infrastructure for the construction and manipulation of conflict graphs; $(ii)$ a preprocessing routine based on a clique strengthening scheme that can both reduce the number of ...
Samuel Souza Brito, Haroldo Gambini Santos   +1 more
openaire   +4 more sources