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

Research output: Contribution to journalConference article

3 Citations (Scopus)

Abstract

Variational 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.

Original languageEnglish (US)
Article number7039824
Pages (from-to)2834-2839
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume2015-February
Issue numberFebruary
DOIs
StatePublished - Jan 1 2014
Event2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014 - Los Angeles, United States
Duration: Dec 15 2014Dec 17 2014

Fingerprint

Linear Complementarity Problem
Variational Inequality Problem
Monotone
Complementarity Problem
Uncertainty
Control theory
Polyhedral Sets
Optimization Theory
Convex Program
Robust Optimization
Distribution-free
Equilibrium Problem
Robust Control
Control Theory
Variational Problem
Exception
Economics
Non-negative
Optimization Problem
Engineering

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

@article{d6fc51de0c9a4b8798aaaf127ab5c0bc,
title = "On robust solutions to uncertain monotone linear complementarity problems (LCPs) and their variants",
abstract = "Variational 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.",
author = "Yue Xie and Shanbhag, {Vinayak V.}",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/CDC.2014.7039824",
language = "English (US)",
volume = "2015-February",
pages = "2834--2839",
journal = "Proceedings of the IEEE Conference on Decision and Control",
issn = "0191-2216",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "February",

}

On robust solutions to uncertain monotone linear complementarity problems (LCPs) and their variants. / Xie, Yue; Shanbhag, Vinayak V.

In: Proceedings of the IEEE Conference on Decision and Control, Vol. 2015-February, No. February, 7039824, 01.01.2014, p. 2834-2839.

Research output: Contribution to journalConference article

TY - JOUR

T1 - On robust solutions to uncertain monotone linear complementarity problems (LCPs) and their variants

AU - Xie, Yue

AU - Shanbhag, Vinayak V.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Variational 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.

AB - Variational 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.

UR - http://www.scopus.com/inward/record.url?scp=84988241332&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84988241332&partnerID=8YFLogxK

U2 - 10.1109/CDC.2014.7039824

DO - 10.1109/CDC.2014.7039824

M3 - Conference article

VL - 2015-February

SP - 2834

EP - 2839

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

IS - February

M1 - 7039824

ER -