AN EFFECTIVE OPTIMIZATION ALGORITHM FOR LOCALLY NONCONVEX LIPSCHITZ FUNCTIONS BASED ON MOLLIFIER SUBGRADIENTS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MAHDAVI AMIRI N.; YOUSEFPOUR R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY Year:2011 | Volume:37 | Issue:1 Page(s): 171-198

Download Full-Text

View:

372

Download:

151

Cites:

Information Journal Paper

Title

AN EFFECTIVE OPTIMIZATION ALGORITHM FOR LOCALLY NONCONVEX LIPSCHITZ FUNCTIONS BASED ON MOLLIFIER SUBGRADIENTS

Author(s)

MAHDAVI AMIRI N. | YOUSEFPOUR R. | Issue Writer Certificate

Keywords

LOCALLY NONCONVEX LIPSCHITZ FUNCTION

MOLLIFIER SUBGRADIENT

MONTE-CARLO METHOD

CLARKE GENERALIZED GRADIENT

DYNAMIC ALGORITHM

Abstract

We present an effective algorithm for minimization of LOCALLY NONCONVEX LIPSCHITZ FUNCTIONs based on mollifier functions approximating the CLARKE GENERALIZED GRADIENT. To this aim, first we approximate the CLARKE GENERALIZED GRADIENT by MOLLIFIER SUBGRADIENTs.To construct this approximation, we use a set of averaged functions gradients. Then, we show that the convex hull of this set serves as a good approximation for the CLARKE GENERALIZED GRADIENT.Using this approximation of the CLARKE GENERALIZED GRADIENT, we establish an algorithm for minimization of locally Lipschitz functions. Based on MOLLIFIER SUBGRADIENT approximation, we propose a DYNAMIC ALGORITHM for finding a direction satisfying the Armijo condition without needing many subgradient evaluations. We prove that the search direction procedure terminates after finitely many iterations and show how to reduce the objective function value in the obtained search direction. We also prove that the first order optimality conditions are satisfied for any accumulation point of the sequence constructed by the algorithm. Finally, we implement our algorithm with MATLAB codes and approximate averaged functions gradients by the MONTE-CARLO METHOD. The numerical results show that our algorithm is effectively more efficient and also more robust than the GS algorithm, currently perceived to be a competitive algorithm for minimization of nonconvex Lipschitz functions.

Cites

No record.

References

No record.

Cite

APA: Copy

MAHDAVI AMIRI, N., & YOUSEFPOUR, R.. (2011). AN EFFECTIVE OPTIMIZATION ALGORITHM FOR LOCALLY NONCONVEX LIPSCHITZ FUNCTIONS BASED ON MOLLIFIER SUBGRADIENTS. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 37(1), 171-198. SID. https://sid.ir/paper/628050/en

Vancouver: Copy

MAHDAVI AMIRI N., YOUSEFPOUR R.. AN EFFECTIVE OPTIMIZATION ALGORITHM FOR LOCALLY NONCONVEX LIPSCHITZ FUNCTIONS BASED ON MOLLIFIER SUBGRADIENTS. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY[Internet]. 2011;37(1):171-198. Available from: https://sid.ir/paper/628050/en

IEEE: Copy

N. MAHDAVI AMIRI, and R. YOUSEFPOUR, “AN EFFECTIVE OPTIMIZATION ALGORITHM FOR LOCALLY NONCONVEX LIPSCHITZ FUNCTIONS BASED ON MOLLIFIER SUBGRADIENTS,” BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, vol. 37, no. 1, pp. 171–198, 2011, [Online]. Available: https://sid.ir/paper/628050/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops