smoothing approximation to the square-order exact penalty functions for constrained optimization
Clicks: 17
ID: 251414
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
4.8
/100
17 views
2 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #293 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
A method is proposed to smooth the square-order exact penalty function for inequality constrained optimization. It is shown that, under some conditions, an approximately optimal solution of the original problem can be obtained by searching an approximately optimal solution of the smoothed penalty problem. An algorithm based on the smoothed penalty functions is given. The algorithm is shown to be convergent under mild conditions. Two numerical examples show that the algorithm seems efficient.
| Reference Key |
lian2013journalsmoothing
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Shujun Lian;Jinli Han |
| Journal | Chemico-biological interactions |
| Year | 2013 |
| DOI |
10.1155/2013/568316
|
| 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.