Zobrazeno 1 - 10
of 23
pro vyhledávání: '"strict minimizers"'
Publikováno v:
Yugoslav Journal of Operations Research, Vol 27, Iss 2, Pp 227-242 (2017)
In this paper, we define some new generalizations of strongly convex functions of order m for locally Lipschitz functions using Clarke subdifferential. Suitable examples illustrating the non emptiness of the newly defined classes of functions and
Externí odkaz:
https://doaj.org/article/6cbe0ba0b06945f5ad9ee90ebafcfe21
Autor:
Sahay Rishi R., Bhatia Guneet
Publikováno v:
Yugoslav Journal of Operations Research, Vol 23, Iss 2, Pp 213-220 (2013)
A second order Mond-Weir type dual is presented for a non-differentiable multiobjective optimization problem with square root terms in the objective as well as in the constraints. Optimality and duality results are presented. Classes of generalized h
Externí odkaz:
https://doaj.org/article/c4bb6f8d16704be3bff5099da7fbce68
Publikováno v:
Yugoslav Journal of Operations Research, Vol 27, Iss 2, Pp 227-242 (2017)
In this paper, we define some new generalizations of strongly convex functions of order m for locally Lipschitz functions using Clarke subdierential. Suitable examples illustrating the nonemptiness of the newly defined classes of functions and their
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88917ba555d58b9f7fa202d402cf0a5f
https://doi.org/10.2298/yjor170119013u
https://doi.org/10.2298/yjor170119013u
Publikováno v:
Fixed Point Theory and Applications, Vol 2011, Iss 1, p 42 (2011)
Abstract In this paper, we consider a class of nonsmooth multiobjective programming problems. Necessary and sufficient optimality conditions are obtained under higher order strongly convexity for Lipschitz functions. We formulate Mond-Weir type dual
Externí odkaz:
https://doaj.org/article/d94cbd80ff394a118536621e577e9e57
Autor:
Rishi Rajan Sahay, Guneet Bhatia
Publikováno v:
Yugoslav Journal of Operations Research, Vol 23, Iss 2, Pp 213-220 (2013)
A second order Mond-Weir type dual is presented for a non-differentiable multiobjective optimization problem with square root terms in the objective as well as in the constraints. Optimality and duality results are presented. Classes of generalized h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea6c9f2583c2dbe0ea1715da52792718
https://doi.org/10.2298/yjor130119024s
https://doi.org/10.2298/yjor130119024s
Autor:
Mila Nikolova
Publikováno v:
SIAM Journal on Imaging Sciences
SIAM Journal on Imaging Sciences, Society for Industrial and Applied Mathematics, 2013, 6 (2), pp.904-937. ⟨10.1137/11085476X⟩
SIAM Journal on Imaging Sciences, Society for Industrial and Applied Mathematics, 2013, 6 (2), pp.904-937. ⟨10.1137/11085476X⟩
We have an M x N real-valued arbitrary matrix A (e.g. a dictionary) with M0. For several decades, this objective has attracted a ceaseless effort to conceive algorithms approaching a good minimizer. Our theoretical contributions, summarized below, sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::310483096890f58075098e8cc9867bc8
https://hal.archives-ouvertes.fr/hal-00723812v7/document
https://hal.archives-ouvertes.fr/hal-00723812v7/document
Autor:
Do Sang Kim, Kwan Deok Bae
Publikováno v:
Fixed Point Theory and Applications, Vol 2011, Iss 1, p 42 (2011)
In this paper, we consider a class of nonsmooth multiobjective programming problems. Necessary and sufficient optimality conditions are obtained under higher order strongly convexity for Lipschitz functions. We formulate Mond-Weir type dual problem a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6772bab78a8d0b011d2711be22718b97
https://doi.org/10.1186/1687-1812-2011-42
https://doi.org/10.1186/1687-1812-2011-42
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.