Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov
The aim of this book was to collect the most recent methods developed for NSO and its practical applications. The book contains seven papers: The first is the foreword by the Guest Editors giving a brief review of NSO and its real-life applications and acknowledging the outstanding contributions of...
Saved in:
HerausgeberIn: | |
---|---|
Sonstige: | |
Year of Publication: | 2020 |
Language: | English |
Physical Description: | 1 electronic resource (116 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
993546110304498 |
---|---|
ctrlnum |
(CKB)5400000000040969 (oapen)https://directory.doabooks.org/handle/20.500.12854/69429 (EXLCZ)995400000000040969 |
collection |
bib_alma |
record_format |
marc |
spelling |
Karmitsa, Napsu edt Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute 2020 1 electronic resource (116 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier The aim of this book was to collect the most recent methods developed for NSO and its practical applications. The book contains seven papers: The first is the foreword by the Guest Editors giving a brief review of NSO and its real-life applications and acknowledging the outstanding contributions of Professor Adil Bagirov to both the theoretical and practical aspects of NSO. The second paper introduces a new and very efficient algorithm for solving uncertain unit-commitment (UC) problems. The third paper proposes a new nonsmooth version of the generalized damped Gauss–Newton method for solving nonlinear complementarity problems. In the fourth paper, the abs-linear representation of piecewise linear functions is extended to yield simultaneously their DC decomposition as well as the pair of generalized gradients. The fifth paper presents the use of biased-randomized algorithms as an effective methodology to cope with NP-hard and nonsmooth optimization problems in many practical applications. In the sixth paper, a problem concerning the scheduling of nuclear waste disposal is modeled as a nonsmooth multiobjective mixed-integer nonlinear optimization problem, and a novel method using the two-slope parameterized achievement scalarizing functions is introduced. Finally, the last paper considers binary classification of a multiple instance learning problem and formulates the learning problem as a nonconvex nonsmooth unconstrained optimization problem with a DC objective function. English Information technology industries bicssc multiple instance learning support vector machine DC optimization nonsmooth optimization achievement scalarizing functions interactive method multiobjective optimization spent nuclear fuel disposal non-smooth optimization biased-randomized algorithms heuristics soft constraints DC function abs-linearization DCA Gauss-Newton method nonsmooth equations nonlinear complementarity problem B-differential superlinear convergence global convergence stochastic programming stochastic hydrothermal UC problem parallel computing asynchronous computing level decomposition 3-03943-835-2 3-03943-836-0 Taheri, Sona edt Karmitsa, Napsu oth Taheri, Sona oth |
language |
English |
format |
eBook |
author2 |
Taheri, Sona Karmitsa, Napsu Taheri, Sona |
author_facet |
Taheri, Sona Karmitsa, Napsu Taheri, Sona |
author2_variant |
n k nk s t st |
author2_role |
HerausgeberIn Sonstige Sonstige |
title |
Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov |
spellingShingle |
Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov |
title_full |
Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov |
title_fullStr |
Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov |
title_full_unstemmed |
Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov |
title_auth |
Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov |
title_new |
Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov |
title_sort |
nonsmooth optimization in honor of the 60th birthday of adil m. bagirov |
publisher |
MDPI - Multidisciplinary Digital Publishing Institute |
publishDate |
2020 |
physical |
1 electronic resource (116 p.) |
isbn |
3-03943-835-2 3-03943-836-0 |
illustrated |
Not Illustrated |
work_keys_str_mv |
AT karmitsanapsu nonsmoothoptimizationinhonorofthe60thbirthdayofadilmbagirov AT taherisona nonsmoothoptimizationinhonorofthe60thbirthdayofadilmbagirov |
status_str |
n |
ids_txt_mv |
(CKB)5400000000040969 (oapen)https://directory.doabooks.org/handle/20.500.12854/69429 (EXLCZ)995400000000040969 |
carrierType_str_mv |
cr |
is_hierarchy_title |
Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov |
author2_original_writing_str_mv |
noLinkedField noLinkedField noLinkedField |
_version_ |
1796652212223475713 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03496nam-a2200625z--4500</leader><controlfield tag="001">993546110304498</controlfield><controlfield tag="005">20231214132948.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr|mn|---annan</controlfield><controlfield tag="008">202105s2020 xx |||||o ||| 0|eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)5400000000040969</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/69429</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)995400000000040969</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Karmitsa, Napsu</subfield><subfield code="4">edt</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Basel, Switzerland</subfield><subfield code="b">MDPI - Multidisciplinary Digital Publishing Institute</subfield><subfield code="c">2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 electronic resource (116 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The aim of this book was to collect the most recent methods developed for NSO and its practical applications. The book contains seven papers: The first is the foreword by the Guest Editors giving a brief review of NSO and its real-life applications and acknowledging the outstanding contributions of Professor Adil Bagirov to both the theoretical and practical aspects of NSO. The second paper introduces a new and very efficient algorithm for solving uncertain unit-commitment (UC) problems. The third paper proposes a new nonsmooth version of the generalized damped Gauss–Newton method for solving nonlinear complementarity problems. In the fourth paper, the abs-linear representation of piecewise linear functions is extended to yield simultaneously their DC decomposition as well as the pair of generalized gradients. The fifth paper presents the use of biased-randomized algorithms as an effective methodology to cope with NP-hard and nonsmooth optimization problems in many practical applications. In the sixth paper, a problem concerning the scheduling of nuclear waste disposal is modeled as a nonsmooth multiobjective mixed-integer nonlinear optimization problem, and a novel method using the two-slope parameterized achievement scalarizing functions is introduced. Finally, the last paper considers binary classification of a multiple instance learning problem and formulates the learning problem as a nonconvex nonsmooth unconstrained optimization problem with a DC objective function.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information technology industries</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">multiple instance learning</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">support vector machine</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">DC optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">nonsmooth optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">achievement scalarizing functions</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">interactive method</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">multiobjective optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">spent nuclear fuel disposal</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">non-smooth optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">biased-randomized algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">heuristics</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">soft constraints</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">DC function</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">abs-linearization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">DCA</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Gauss-Newton method</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">nonsmooth equations</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">nonlinear complementarity problem</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">B-differential</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">superlinear convergence</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">global convergence</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">stochastic programming</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">stochastic hydrothermal UC problem</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">parallel computing</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">asynchronous computing</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">level decomposition</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-03943-835-2</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-03943-836-0</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Taheri, Sona</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Karmitsa, Napsu</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Taheri, Sona</subfield><subfield code="4">oth</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-12-15 05:38:09 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2022-04-04 09:22:53 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5338115650004498&Force_direct=true</subfield><subfield code="Z">5338115650004498</subfield><subfield code="b">Available</subfield><subfield code="8">5338115650004498</subfield></datafield></record></collection> |