Results 11 to 20 of about 55,445 (267)
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 +2 more
openaire +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 +3 more
doaj +1 more source
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 +3 more
doaj +1 more source
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
ℓ
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
Volumetric Barrier Cutting Plane Algorithms for Stochastic Linear Semi-Infinite Optimization
IEEE Access, 2020 In this paper, we study the two-stage stochastic linear semi-infinite programming with recourse to handle uncertainty in data defining (deterministic) linear semi-infinite programming.
Baha Alzalg, Asma Gafour, Lewa Alzaleq
doaj +1 more source
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. +3 more
openaire +3 more sources
Understanding cutting planes for QBFs [PDF]
Information and Computation, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Beyersdorff, O +3 more
openaire +4 more sources
A New Efficient Algorithm for Hazardous Material Transportation Problem via Lane Reservation
IEEE Access, 2019 Hazardous material transportation is well-known for its high potential risk. Minimizing the transportation risk is an important issue for hazardous material transportation. This paper focuses on a novel algorithm for the hazardous material transportation
Zhen Zhou +4 more
doaj +1 more source