Zobrazeno 1 - 10
of 37
pro vyhledávání: '"K. A. Ariyawansa"'
Autor:
K. A. Ariyawansa, Baha Alzalg
Publikováno v:
Journal of Mathematical Analysis and Applications. 409:973-995
We introduce and study two-stage stochastic symmetric programs with recourse to handle uncertainty in data defining (deterministic) symmetric programs in which a linear function is minimized over the intersection of an affine set and a symmetric cone
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ffc2a6c16fc99d0c3926a901b9c46c0
https://doi.org/10.1016/j.jmaa.2013.07.075
https://doi.org/10.1016/j.jmaa.2013.07.075
Publikováno v:
Journal of Optimization Theory and Applications. 155:1073-1083
Ariyawansa and Zhu have proposed a new class of optimization problems termed stochastic semidefinite programs to handle data uncertainty in applications leading to (deterministic) semidefinite programs. For stochastic semidefinite programs with finit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5730b51b271d9e167521234789544d2a
https://doi.org/10.1007/s10957-012-0110-x
https://doi.org/10.1007/s10957-012-0110-x
Autor:
K. A. Ariyawansa, Yuntao Zhu
Publikováno v:
Applied Mathematical Modelling. 35(5):2425-2442
Ariyawansa and Zhu have recently introduced (two-stage) stochastic semidefinite programs (with recourse) (SSDPs) [1] and chance-constrained semidefinite programs (CCSDPs) [2] as paradigms for dealing with uncertainty in applications leading to semide
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::894da870b3c71f3c61961aa44f357a8a
Autor:
Yuntao Zhu, K. A. Ariyawansa
Publikováno v:
Mathematics of Computation. 80:1639-1661
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d2414cd636102e15ca10eb227901f93
https://doi.org/10.1090/s0025-5718-2010-02449-4
https://doi.org/10.1090/s0025-5718-2010-02449-4
Publikováno v:
Networks & Heterogeneous Media. 3:125-148
We study quasi-static deformation of dense granular packings. In the reference configuration, a granular material is under confining stress (pre-stress). Then the packing is deformed by imposing external boundary conditions, which model engineering e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::111d86617df62e8a60ad5edca8ae45de
https://doi.org/10.3934/nhm.2008.3.125
https://doi.org/10.3934/nhm.2008.3.125
Autor:
K. A. Ariyawansa, Wayne L. Tabor
Publikováno v:
Journal of Mathematical Analysis and Applications. 334:716-737
A family of algorithms for approximate solution of the bound-constrained minimization problem was introduced in [K.A. Ariyawansa, W.L. Tabor, A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a546cf008f8df32bf01b196257ef28e1
https://doi.org/10.1016/j.jmaa.2006.09.077
https://doi.org/10.1016/j.jmaa.2006.09.077
Autor:
K. A. Ariyawansa, Yuntao Zhu
Publikováno v:
4OR. 4:239-253
Semidefinite programs are a class of optimization problems that have been studied extensively during the past 15 years. Semidefinite programs are naturally related to linear programs, and both are defined using deterministic data. Stochastic programs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b8de1ce175c9b52d46bba2e4e2ab0ee
https://doi.org/10.1007/s10288-006-0016-2
https://doi.org/10.1007/s10288-006-0016-2
Publikováno v:
Journal of Mathematical Modelling and Algorithms. 4:369-390
Ariyawansa and Felt (2001, 2004) have recently created a test problem collection for testing software for stochastic linear programs. This freely-available, web-based collection was originally created with 35 problem instances from 11 problem familie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb713fe93c2ecdcc95f7ec96735afe62
https://doi.org/10.1007/s10852-005-3082-0
https://doi.org/10.1007/s10852-005-3082-0
Autor:
Andrew J. Felt, K. A. Ariyawansa
Publikováno v:
INFORMS Journal on Computing. 16:291-299
The purpose of this paper is to introduce a new test-problem collection for stochastic linear programming that the authors have recently begun to assemble. While there are existing stochastic programming test-problem collections, our new collection h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58cbea3e9d8a7c0be94718ff80dac3a7
https://doi.org/10.1287/ijoc.1030.0037
https://doi.org/10.1287/ijoc.1030.0037
Autor:
Wayne L. Tabor, K. A. Ariyawansa
Publikováno v:
Computing. 70:25-39
Ariyawansa [2] has introduced a line search termination criterion for collinear scaling minimization algorithms. However, he verified that this criterion provides sufficient decrease only in the case of objective functions that satisfy certain strong
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f12561766182a5c5782d8f1e1e0771b
https://doi.org/10.1007/s00607-002-1466-9
https://doi.org/10.1007/s00607-002-1466-9