Approximation and optimization of polyhedral discrete and differential inclusions

Elimhan N. Mahmudov*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In the first part of the paperoptimization of polyhedral discrete and differential inclusions is considered, the problem is reduced to convex minimization problem and the necessary and sufficient condition for optimality is derived. The optimality conditions for polyhedral differential inclusions based on discrete-approximation problem according to continuous problems are formulated. In particular, boundedness of the set of adjoint discrete solutions and upper semicontinuity of the locally adjoint mapping are proved. In the second part of paper an optimization problem described by convex inequality constraint is studied. By using the equivalence theorem concerning the subdifferential calculus and approximating method necessary and sufficient condition for discrete-approximation problem with inequality constraint is established.

Original languageEnglish
Title of host publicationAdvances in Computational Intelligence - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Proceedings
Pages364-372
Number of pages9
EditionPART 4
DOIs
Publication statusPublished - 2012
Event14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012 - Catania, Italy
Duration: 9 Jul 201213 Jul 2012

Publication series

NameCommunications in Computer and Information Science
NumberPART 4
Volume300 CCIS
ISSN (Print)1865-0929

Conference

Conference14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012
Country/TerritoryItaly
CityCatania
Period9/07/1213/07/12

Keywords

  • discrete-approximation
  • dual cone
  • inequality constraint
  • polyhedral
  • Set-valued
  • subdifferential
  • uniformly bounded
  • upper semicontinuous

Fingerprint

Dive into the research topics of 'Approximation and optimization of polyhedral discrete and differential inclusions'. Together they form a unique fingerprint.

Cite this