File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: On robust solutions to uncertain monotone linear complementarity problems (LCPs) and their variants

TitleOn robust solutions to uncertain monotone linear complementarity problems (LCPs) and their variants
Authors
Issue Date2014
Citation
53rd IEEE Conference on Decision and Control, Los Angeles, CA, 15-17 December 2014. In Conference Proceedings, 2014, p. 2834-2839 How to Cite?
AbstractVariational inequality and complementarity problems have found utility in modeling a range of optimization and equilibrium problems arising in engineering, economics, and the sciences. Yet, while there have been tremendous growth in addressing uncertainty in optimization, far less progress has been seen in the context of variational inequality problems, exceptions being the efforts to solve variational inequality problems with expectation-valued maps [1], [2]. Yet, in many instances, the goal lies in obtaining solutions that are robust to uncertainty. While the fields of robust optimization and control theory have made deep inroads into developing tractable schemes for resolving such concerns, there has been little progress in the context of variational problems. In what we believe is amongst the very first efforts to comprehensively address such problems in a distribution-free environment, we present an avenue for obtaining robust solutions to uncertain monotone affine complementarity problems defined over the nonnegative orthant. We begin with and mainly focus on showing that robust solutions to such problems can be tractably obtained through the solution of a single convex program. Importantly, we discuss how these results can be extended to account for uncertainty in the associated sets by generalizing the results to uncertain affine variational inequality problems defined over uncertain polyhedral sets.
Persistent Identifierhttp://hdl.handle.net/10722/309231
ISSN
2023 SCImago Journal Rankings: 0.721
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorXie, Yue-
dc.contributor.authorShanbhag, Uday V.-
dc.date.accessioned2021-12-15T03:59:48Z-
dc.date.available2021-12-15T03:59:48Z-
dc.date.issued2014-
dc.identifier.citation53rd IEEE Conference on Decision and Control, Los Angeles, CA, 15-17 December 2014. In Conference Proceedings, 2014, p. 2834-2839-
dc.identifier.issn0743-1546-
dc.identifier.urihttp://hdl.handle.net/10722/309231-
dc.description.abstractVariational inequality and complementarity problems have found utility in modeling a range of optimization and equilibrium problems arising in engineering, economics, and the sciences. Yet, while there have been tremendous growth in addressing uncertainty in optimization, far less progress has been seen in the context of variational inequality problems, exceptions being the efforts to solve variational inequality problems with expectation-valued maps [1], [2]. Yet, in many instances, the goal lies in obtaining solutions that are robust to uncertainty. While the fields of robust optimization and control theory have made deep inroads into developing tractable schemes for resolving such concerns, there has been little progress in the context of variational problems. In what we believe is amongst the very first efforts to comprehensively address such problems in a distribution-free environment, we present an avenue for obtaining robust solutions to uncertain monotone affine complementarity problems defined over the nonnegative orthant. We begin with and mainly focus on showing that robust solutions to such problems can be tractably obtained through the solution of a single convex program. Importantly, we discuss how these results can be extended to account for uncertainty in the associated sets by generalizing the results to uncertain affine variational inequality problems defined over uncertain polyhedral sets.-
dc.languageeng-
dc.relation.ispartof53rd IEEE Conference on Decision and Control-
dc.titleOn robust solutions to uncertain monotone linear complementarity problems (LCPs) and their variants-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/CDC.2014.7039824-
dc.identifier.scopuseid_2-s2.0-84988241332-
dc.identifier.spage2834-
dc.identifier.epage2839-
dc.identifier.isiWOS:000370073802157-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats