generalized minimax programming with nondifferentiable (g, β)-invexity
Clicks: 6
ID: 137733
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
1.5
/100
6 views
5 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #314 of 357 articles by views in Chemico-biological interactions
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 357 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz (G, β)-invex.
Not only G-sufficient but also G-necessary optimality conditions are established for problem (P).
With G-necessary optimality conditions and (G, β)-invexity on hand, we construct dual problem (DI) for the
primal one (P) and prove duality results between problems (P) and (DI). These results extend several known results to a wider class of programs.
| Reference Key |
yuan2013journalgeneralized
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;D. H. Yuan;X. L. Liu |
| Journal | Chemico-biological interactions |
| Year | 2013 |
| DOI |
10.1155/2013/854125
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.