Preferred Language
Articles
/
2RbNdIcBVTCNdQwCOkyf
Strong Fenchel Duality for Evenly Convex Optimization Problems
...Show More Authors

Among a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.

Scopus Clarivate
View Publication
Publication Date
Thu Sep 05 2019
Journal Name
Journal Of Al-qadisiyah For Computer Science And Mathematics
Strongly (E,F)-convexity with applications to optimization problems
...Show More Authors

In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex. 

View Publication
Crossref (1)
Crossref
Publication Date
Thu Jan 20 2022
Journal Name
Webology
Red Monkey Optimization and Genetic Algorithm to Solving Berth Allocation Problems
...Show More Authors

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Apr 11 2016
Journal Name
Annals Of Fuzzy Mathematics And Informatics
Some notions on convex soft sets
...Show More Authors

View Publication
Publication Date
Sun Nov 17 2019
Journal Name
Journal Of Interdisciplinary Mathematics
Fuzzy preinvexity via ranking value functions with applications to fuzzy optimization problems
...Show More Authors

View Publication
Scopus (4)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Wed Jan 01 2020
Journal Name
Italian Journal Of Pure And Applied Mathematics
Duality of St-closed submodules and semi-extending modules
...Show More Authors

The main goal of this paper is to dualize the two concepts St-closed submodule and semi-extending module which were given by Ahmed and Abbas in 2015. These dualizations are called CSt-closed submodule and cosemi-extending mod- ule. Many important properties of these dualizations are investigated, as well as some others useful results which mentioned by those authors are dualized. Furthermore, the relationships of cosemi-extending and other related modules are considered.

View Publication Preview PDF
Scopus (2)
Scopus
Publication Date
Mon Jan 01 2007
Journal Name
Journal Of Al-nahrain University
Applications Of Strong-Lensing For Some Gravitational Lenses
...Show More Authors

In our work present, the application of strong-Lensing observations for some gravitational lenses have been adopted to study the geometry of the universe and to explain the physics and the size of the quasars. The first procedure was to study the geometrical of the Lensing system to determine the relation between the redshift of the gravitational observations with its distances. The second procedure was to compare between the angular diameter distances "DA" calculated from the Euclidean case with that from the Freedman models, then evaluating the diameter of the system lens. The results concluded that the phenomena are restricted to the ratio of distance between lens and source with the diameter of the lens noticing.

Publication Date
Sat Dec 01 2012
Journal Name
International Journal Of Contemporary Mathematical Sciences
Approximation by Convex Polynomials in Weighted Spaces
...Show More Authors

Here, we found an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to convex polynomial by means of weighted Totik-Ditzian modulus of continuity

Publication Date
Mon Jul 01 2019
Journal Name
Iop Conference Series: Materials Science And Engineering
Semi E<sup>h</sup>-b-preinvexity and its applications to optimization problems
...Show More Authors
Abstract<p>In this paper, the class of semi <italic>E</italic> <sup> <italic>h</italic> </sup>-<italic>b</italic>-preinvex and pseudo <italic>E</italic> <sup> <italic>h</italic> </sup>-b-preinvex functions are defined as an extension of <italic>E-B</italic>-preinvex and <italic>h</italic>-preinvex functions. In this extension the functions <italic>E</italic>:ℝ<sup> <italic>n</italic> </sup> → ℝ<sup> </sup></p> ... Show More
View Publication
Scopus (1)
Crossref (1)
Scopus Crossref
Publication Date
Sun Dec 01 2013
Journal Name
Al- Mustansiriyah Journal Science
Convex Approximation by q- Meyer-König-Zeller Durrmeyer Operators
...Show More Authors

Publication Date
Sun Sep 01 2013
Journal Name
Archives Des Sciences
Convex Approximation in Terms of Fractional Weighted Moduli of Smoothness
...Show More Authors

This paper deals with founding an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to the convex polynomials by means of weighted moduli of smoothness of fractional order  , ( , ) p f t . In addition we prove some properties of weighted moduli of smoothness of fractional order.