Results 31 to 40 of about 304,321 (280)

Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded [PDF]

, 2019
Decision trees usefully represent sparse, high dimensional and noisy data. Having learned a function from this data, we may want to thereafter integrate the function into a larger decision-making problem, e.g., for picking the best chemical process ...
Krennrich, Gerhard, Lee, Robert M., Letsios, Dimitrios, Misener, Ruth, Mistry, Miten   +4 more
core   +2 more sources

An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets

Journal of Mathematics, 2021
The paper proposes an inertial accelerated algorithm for solving split feasibility problem with multiple output sets. To improve the feasibility, the algorithm involves computing of projections onto relaxed sets (half spaces) instead of computing onto ...
Huijuan Jia, Shufen Liu, Yazheng Dang
doaj   +1 more source

An inertial extrapolation method for multiple-set split feasibility problem

Journal of Inequalities and Applications, 2020
In this paper, we propose an iterative algorithm with inertial extrapolation to approximate the solution of multiple-set split feasibility problem. Based on Lopez et al. (Inverse Probl.
Guash Haile Taddele, Poom Kumam, Anteneh Getachew Gebrie   +2 more
doaj   +1 more source

Modified Inertial Algorithms for a Class of Split Feasibility Problems and Fixed Point Problems in Hilbert Spaces [PDF]

Sahand Communications in Mathematical Analysis, 2022
In this work, we introduce an iterative algorithm for solving the split feasibility problem on zeros of the sum of monotone operators and fixed point sets and also solving the fixed point problem of a nonexpansive mapping.
Montira Suwannaprapa
doaj   +1 more source

A NEW ITERATIVE METHOD FOR SOLVING SPLIT FEASIBILITY PROBLEM

Journal of Applied Analysis & Computation, 2020
Summary: In this paper, we construct a new iterative algorithm and show that the newly introduced iterative algorithm converges faster than a number of existing iterative algorithms for contractive-like mappings. We present a numerical example followed by graphs to validate our claim. We prove strong and weak convergence results for approximating fixed
Garodia, Chanchal, Uddin, Izhar
openaire   +1 more source

An intermixed iteration for constrained convex minimization problem and split feasibility problem

Journal of Inequalities and Applications, 2019
In this paper, we first introduce the two-step intermixed iteration for finding the common solution of a constrained convex minimization problem, and also we prove a strong convergence theorem for the intermixed algorithm.
Kanyanee Saechou, Atid Kangtunyakarn
doaj   +1 more source

The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem

Journal of Inequalities and Applications, 2021
The multiple-sets split feasibility problem is the generalization of split feasibility problem, which has been widely used in fuzzy image reconstruction and sparse signal processing systems.
Wenting Chen, Meixia Li
doaj   +1 more source

Iterative algorithms for split variational Inequalities and generalized split feasibility problems with applications [PDF]

Journal of Nonlinear and Variational Analysis, 2019
Summary: In this paper, we present extragradient and modified extragradient iterative algorithms for solving a common solution of a finite family of split variational inequalities and generalized split feasibility problems. Applications of our main results to equilibrium and optimization problems are provided.
Chidume, Charles E., Nnakwe, Monday O.
openaire   +1 more source

New Iterative Algorithm for Solving Constrained Convex Minimization Problem and Split Feasibility Problem

European Journal of Mathematical Analysis, 2021
The purpose of this paper is to introduce a new iterative algorithm to approximate the fixed points of almost contraction mappings and generalized α-nonexpansive mappings.
Austine Efut Ofem, Unwana Effiong Udofia, Donatus Ikechi Igbokwe   +2 more
doaj   +1 more source

Applications of Fixed-Point and Optimization Methods to the Multiple-Set Split Feasibility Problem

Journal of Applied Mathematics, 2012
The multiple-set split feasibility problem requires finding a point closest to a family of closed convex sets in one space such that its image under a linear transformation will be closest to another family of closed convex sets in the image space.
Yonghong Yao, Rudong Chen, Giuseppe Marino, Yeong Cheng Liou   +3 more
doaj   +1 more source