Journal of Global Optimization
IF
2.21
Papers
3,001
Papers 2,952
1 page of 296 pages (2,952 results)
Newest
#1Regina S. Burachik (University of South Australia)H-Index: 24
#2Yaohua Hu (SZU: Shenzhen University)H-Index: 11
Last. Xiaoqi Yang (HKPU: Hong Kong Polytechnic University)H-Index: 54
view all 3 authors...
An interior quasi-subgradient method is proposed based on the proximal distance to solve constrained nondifferentiable quasi-convex optimization problems in Hilbert spaces. It is shown that a newly introduced generalized Gâteaux subdifferential is a subset of a quasi-subdifferential. The convergence properties, including the global convergence and iteration complexity, are investigated under the assumption of the Holder condition of order p, when using the constant/diminishing/dynamic stepsize r...
Source
#1Marco Locatelli (UNIPR: University of Parma)H-Index: 31
In this paper we describe how to derive the convex envelope of a function f over the n-dimensional unit simplex null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null $\Delta _n null null null null null null null null null null null null null null null null null...
Source
#1Lawrence Mandow (UMA: University of Malaga)H-Index: 13
#2José-Luis Pérez-de-la-Cruz (UMA: University of Malaga)H-Index: 14
Last. N. Pozas (UMA: University of Malaga)H-Index: 1
view all 3 authors...
This paper addresses the problem of approximating the set of all solutions for Multi-objective Markov Decision Processes. We show that in the vast majority of interesting cases, the number of solutions is exponential or even infinite. In order to overcome this difficulty we propose to approximate the set of all solutions by means of a limited precision approach based on White’s multi-objective value-iteration dynamic programming algorithm. We prove that the number of calculated solutions is trac...
Source
#1Banu Kabakulak (Istanbul Bilgi University)
#2Z. Caner Taşkın (Boğaziçi University)H-Index: 10
Last. Ali Emre Pusane (Boğaziçi University)H-Index: 21
view all 3 authors...
Channel coding aims to minimize the errors that occur during the transmission of digital information from one place to another. Low-density parity-check codes can detect and correct transmission errors if one encodes the original information by adding redundant bits. In practice, heuristic iterative decoding algorithms are used to decode the received vector. However, these algorithms may fail to decode if the received vector contains multiple errors. We consider decoding the received vector with...
Source
#1M. R. Safi (University of Windsor)H-Index: 5
#2Seyed Saeed Nabavi (Semnan University)
Last. Richard J. Caron (University of Windsor)H-Index: 3
view all 3 authors...
A real symmetric matrix A is copositive if null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null $x^\top Ax\ge 0 null null null null null null null null null null null null null null null null null null null null null nul...
Source
#1Xi Yin Zheng (Yunnan University)H-Index: 17
#2Jiangxing Zhu (Yunnan University)
In this paper, in contrast to the literature on the tilt-stability only dealing with local minima, we introduce and study the null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null $\psi null null null null null null null null null null null null null null null...
Source
#1Nicolau Andrés-Thió (University of Melbourne)H-Index: 1
#2Marcus Brazil (University of Melbourne)H-Index: 19
Last. Marcus Volz (University of Melbourne)H-Index: 2
view all 5 authors...
A Euclidean skeleton is a set of edges in the interior (or on the boundary) of a polygon that intersects any line segment that joins two points outside of the polygon and that intersects the polygon. In this paper we study minimum cardinality Euclidean skeletons and develop an algorithm for constructing them. We first prove a number of structural properties of minimum skeletons and use these to develop a canonical form. We then design an exact algorithm which initially generates a set of canonic...
Source
#1Cheng Lu (CAS: Chinese Academy of Sciences)
#2Wenguo Yang (CAS: Chinese Academy of Sciences)H-Index: 6
Last. Suixiang Gao (CAS: Chinese Academy of Sciences)H-Index: 6
view all 3 authors...
In this paper, we study the problem of maximizing a monotone non-decreasing submodular function null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null $f :2^\Omega \rightarrow {\mathbb {R}}_{+} null null null null null null null null null null null null null nul...
Source
Every continuously differentiable function can be represented as a difference between a convex function and an additively separable convex function. We show that a DC function with this structure can be optimized using the rectangular algorithm for separable nonconvex optimization, and develop a revision to this algorithm for practical use. We also report some numerical results which indicate the effectiveness of the revision.
Source
#1César Gutiérrez (University of Valladolid)H-Index: 15
#2R. J. López (University of Tarapacá)
Last. J. Martínez (University of Tarapacá)
view all 3 authors...
We introduce notions of generalized null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null $\varepsilon null null null null null null null null null null null null null null null null null null null null null null null null null -quasi solutions to approximate ...
Source
12345678910
Top fields of study
This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.