WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Language
    অসমীয়া বাংলা भोजपुरी डोगरी English ગુજરાતી हिंदी ಕನ್ನಡ
    Khasi कोंकणी मैथिली മലയാളം ꯃꯤꯇꯩ ꯂꯣꯟ मराठी Mizo नेपाली
    ଓଡ଼ିଆ ਪੰਜਾਬੀ संस्कृत ᱥᱟᱱᱛᱟᱲᱤ सिन्धी தமிழ் తెలుగు اردو
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Mathematical Methods of Operations Research
  2. Mathematical Methods of Operations Research : Volume 67
  3. Mathematical Methods of Operations Research : Volume 67, Issue 2, April 2008
  4. Supremizers of inner γ-convex functions
Loading...

Please wait, while we are loading the content...

Mathematical Methods of Operations Research : Volume 85
Mathematical Methods of Operations Research : Volume 84
Mathematical Methods of Operations Research : Volume 83
Mathematical Methods of Operations Research : Volume 82
Mathematical Methods of Operations Research : Volume 81
Mathematical Methods of Operations Research : Volume 80
Mathematical Methods of Operations Research : Volume 79
Mathematical Methods of Operations Research : Volume 78
Mathematical Methods of Operations Research : Volume 77
Mathematical Methods of Operations Research : Volume 76
Mathematical Methods of Operations Research : Volume 75
Mathematical Methods of Operations Research : Volume 74
Mathematical Methods of Operations Research : Volume 73
Mathematical Methods of Operations Research : Volume 72
Mathematical Methods of Operations Research : Volume 71
Mathematical Methods of Operations Research : Volume 70
Mathematical Methods of Operations Research : Volume 69
Mathematical Methods of Operations Research : Volume 68
Mathematical Methods of Operations Research : Volume 67
Mathematical Methods of Operations Research : Volume 67, Issue 3, June 2008
Mathematical Methods of Operations Research : Volume 67, Issue 2, April 2008
An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
Supremizers of inner γ-convex functions
A sequential method for a class of box constrained quadratic programming problems
Some insight into characterizations of minimally nonideal matrices
On infinite horizon optimal stopping of general random walk
Analytic study of multiserver buffers with two-state Markovian arrivals and constant service times of multiple slots
Admission control of a service station when the arrivals are internal
An envelope theorem and some applications to discounted Markov decision processes
Constrained continuous-time Markov decision processes with average criteria
Packet reordering in networks with heavy-tailed delays
Mathematical Methods of Operations Research : Volume 67, Issue 1, February 2008
Mathematical Methods of Operations Research : Volume 66
Mathematical Methods of Operations Research : Volume 65
Mathematical Methods of Operations Research : Volume 64
Mathematical Methods of Operations Research : Volume 63
Mathematical Methods of Operations Research : Volume 62
Mathematical Methods of Operations Research : Volume 61
Mathematical Methods of Operations Research : Volume 60
Mathematical Methods of Operations Research : Volume 59
Mathematical Methods of Operations Research : Volume 58
Mathematical Methods of Operations Research : Volume 57
Mathematical Methods of Operations Research : Volume 56
Mathematical Methods of Operations Research : Volume 55
Mathematical Methods of Operations Research : Volume 54
Mathematical Methods of Operations Research : Volume 53
Mathematical Methods of Operations Research : Volume 52
Mathematical Methods of Operations Research : Volume 51
Mathematical Methods of Operations Research : Volume 50
Mathematical Methods of Operations Research : Volume 49
Mathematical Methods of Operations Research : Volume 48
Mathematical Methods of Operations Research : Volume 47
Mathematical Methods of Operations Research : Volume 46
Mathematical Methods of Operations Research : Volume 45

Similar Documents

...
Inner γ-Convex Functions in Normed Linear Spaces

Article

...
Global infimum of strictly convex quadratic functions with bounded perturbations

Article

...
Some Analytical Properties of γ-Convex Functions in Normed Linear Spaces

Article

...
An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization

Article

...
On smoothness properties of optimal value functions at the boundary of their domain under complete convexity

Article

...
On Second-Order Generalized Convexity

Article

...
Biconvex sets and optimization with biconvex functions: a survey and extensions

Article

...
Relaxations of factorable functions with convex-transformable intermediates

Article

...
On duality for square root convex programs

Article

Supremizers of inner γ-convex functions

Content Provider Springer Nature Link
Author Phu, Hoang Xuan
Copyright Year 2007
Abstract A real-valued function f defined on a convex subset D of some normed linear space is said to be inner γ-convex w.r.t. some fixed roughness degree γ  >  0 if there is a $$\nu \in]0, 1]$$ such that $${\rm sup}_{\lambda\in[2,1+1/\nu]} \left(f((1 - \lambda)x_0 + \lambda x_1) - (1 - \lambda) f (x_0)-\right. \left.\lambda f(x_1)\right) \geq 0$$ holds for all $$x_0, x_1 \in D$$ satisfying ||x 0 − x 1||  =  νγ and $$-(1/\nu)x_0+(1+1/\nu)x_1\in D$$ . This kind of roughly generalized convex functions is introduced in order to get some properties similar to those of convex functions relative to their supremum. In this paper, numerous properties of their supremizers are given, i.e., of such $$x^* \in D$$ satisfying lim $${\rm sup}_{x \to x^*}f(x) = {\rm sup}_{x \in D} f(x)$$ . For instance, if an upper bounded and inner γ-convex function, which is defined on a convex and bounded subset D of some inner product space, has supremizers, then there exists a supremizer lying on the boundary of D relative to aff D or at a γ-extreme point of D, and if D is open relative to aff D or if dim D  ≤  2 then there is certainly a supremizer at a γ-extreme point of D. Another example is: if D is an affine set and $$f : D \to {\mathbb{R}}$$ is inner γ-convex and bounded above, then $${\rm sup}_{x'\in \bar B(x,\gamma/2)\cap D}f(x')= \sup_{x'\in D}f(x')$$ for all $$x \in D$$ , and if 2 ≤  dim D  <  ∞ then each $$x \in D$$ is a supremizer of f.
Ending Page 222
Page Count 16
Starting Page 207
File Format PDF
ISSN 14322994
e-ISSN 14325217
Journal Mathematical Methods of Operations Research
Issue Number 2
Volume Number 67
Language English
Publisher Springer-Verlag
Publisher Date 2007-10-24
Publisher Place Berlin, Heidelberg
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Supremizer Axiomatic and generalized convexity γ-Extreme point Calculus of Variations and Optimal Control; Optimization Business/Management Science Operations Research/Decision Theory Convex functions and convex programs Nonconvex programming, global optimization Inner γ-convex function Generalized convexity Rough convexity
Content Type Text
Resource Type Article
Subject Management Science and Operations Research Mathematics Software
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
Cite this Content
Loading...