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
Mathematics of Operations Research
Article . 1996 . Peer-reviewed
Data sources: Crossref
DBLP
Article
Data sources: DBLP
https://dx.doi.org/10.1287/moo...
Article
Data sources: Microsoft Academic Graph
 View all 3 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Noncoercive Optimization Problems

Noncoercive optimization problems
descriptionPublicationkeyboard_double_arrow_right Article 01 Nov 1996 English Publisher:Institute for Operations Research and the Management Sciences (INFORMS)Journal:Mathematics of Operations Research, volume 21, pages 769-782 (issn: 0364-765X, eissn: 1526-5471, Copyright policy )
Authors: Alfred Auslender;

doi: 10.1287/moor.21.4.769

Noncoercive Optimization Problems

Abstract

This paper modifies a recent sufficient condition for the existence of optimal solutions proposed by Buttazzo and Tomarelli, to obtain a condition that is necessary and sufficient. Applications to mathematical programming are given and stability results established.

Related Organizations
Keywords

noncoercive optimization, Convex programming, Nonlinear programming, Sensitivity, stability, parametric optimization, stability results, Nonconvex programming, global optimization, existence of optimal solutions

  • 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).
    		 33
    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.
    		 Average
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!
33
Top 10%
Top 10%
Average
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!
uploadUpload now