Results 1 to 10 of about 55,915 (214)
Analytic center cutting plane methods for variational inequalities over convex bodies [PDF]
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
Point Cloud Classification by Domain Adaptation Using Recycling Max Pooling and Cutting Plane Identification. [PDF]
Yoo H, Jun K.
europepmc +3 more sources
Wound Healing on the Cutting Plane of Ankle Bones after Incomplete Revascularization for Chronic Limb-Threatening Ischemia in an Elderly Patient: A Case Report. [PDF]
Kikuchi S +8 more
europepmc +3 more sources
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
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
Anisotropic micro cutting of rolled titanium alloy
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
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
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
ℓ
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
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

