Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
SIAM Journal on Control and Optimization
Article . 1988 . Peer-reviewed
Data sources: Crossref
versions View all 2 versions
addClaim

Optimal Control of Strongly Monotone Variational Inequalities

Optimal control of strongly monotone variational inequalities
Authors: Shi, Shuzhong;

Optimal Control of Strongly Monotone Variational Inequalities

Abstract

The author considers nonconvex optimal control problems for general strongly monotone variational inequalities. The main result of the paper is the construction of necessary conditions of optimality. In the derivation of these conditions the problem is penalized; using variational tools as Ekeland's principle, the lopsided minimax theorem and a generalized Palais-Smale condition, the approximations are shown to converge, whence the desired result is established.

Related Organizations
Keywords

lopsided minimax theorem, strongly monotone variational inequalities, Ekeland's principle, generalized Palais-Smale condition, nonconvex optimal control, Existence theories for problems in abstract spaces, Unilateral problems; variational inequalities (elliptic type), Variational inequalities (global problems) in infinite-dimensional spaces, Existence of solutions for minimax problems, necessary conditions of optimality, Variational inequalities

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    30
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
30
Top 10%
Top 10%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!