Results 131 to 140 of about 6,104 (162)
Some of the next articles are maybe not open access.
Incomplete projection algorithms for solving the convex feasibility problem
Numerical Algorithms, 1998The aim of the paper is to present a general scheme for the convex feasibility problem and to prove its convergence under mild conditions. The salient features of the proposed scheme are: (a) No exact projections are required. (b) An acceleration factor \(\lambda\) is introduced, which seems to play a fundamental role in improving the quality of ...
Ubaldo M. García-Palomares +1 more
openaire +1 more source
On the convex hull of feasible solutions to certain combinatorial problems
Operations Research Letters, 1992This paper deals with the question: In which cases is the convex hull of a finite union of (unbounded) convex polyhedra closed and hence a convex polyhedron itself? First the authors present three examples of combinatorial problems (the Steiner graphical Travelling Salesman problem, a nonpreemptive single-machine scheduling problem with changeover ...
Maurice Queyranne, Yaoguang Wang
openaire +1 more source
Non-Convex feasibility problems and proximal point methods
Optimization Methods and Software, 2004A feasibility problem typically amounts to locate at least one point which belongs to several closed subsets of a Euclidean space. Equivalently, one might seek a vector which minimizes several associated objectives. We develop a method to solve a class of such problems, allowing here non-convex sets or functions.
Jean-Noël Corvellec, Sjur Didrik Flåm
openaire +1 more source
Feasible partition problem in reverse convex and convex mixed-integer programming
European Journal of Operational Research, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Indoor wireless localization via convex feasibility problem
2014 International Conference on Indoor Positioning and Indoor Navigation (IPIN), 2014Node localization in wireless sensor networks (WSNs) aims to determine unknown target position given anchors' known positions and available relative pairwise measurements among directly-connected neighboring nodes. From this point of view, WSNs can be divided into two groups based on collaboration between targets: cooperative networks in which the ...
Thu L. N. Nguyen, Yoan Shin
openaire +1 more source
Random minibatch projection algorithms for convex feasibility problems
2019 IEEE 58th Conference on Decision and Control (CDC), 2019This paper deals with the convex feasibility problem where the feasible set is given as the intersection of a (possibly infinite) number of closed convex sets. We assume that each set is specified algebraically as a convex inequality, where the associated convex function may be even non-differentiable.
Angelia Nedic, Ion Necoara
openaire +1 more source
Iterative Methods of Solving Stochastic Convex Feasibility Problems and Applications
Computational Optimization and Applications, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dan Butnariu +2 more
openaire +2 more sources
The Convex Feasibility Problem in Image Recovery
1996Publisher Summary Image recovery is a broad discipline that encompasses the large body of inverse problems, in which an image h is to be inferred from the observation of data x consisting of signals physically or mathematically related to it. Image restoration and image reconstruction are the two main sub-branches of image recovery.
openaire +1 more source
Iterative Methods for the Convex Feasibility Problem
1984The problem of finding a point in the intersection of a finite family of closed convex sets in the Euclidean space is considered here. Several iterative methods for its solution are reviewed and some connections between them are pointed out.
openaire +1 more source
Distributed algorithms for solving the convex feasibility problems
Science China Information Sciences, 2020Kaihong Lu +2 more
openaire +1 more source