On a New Optimization Method With Constraints

Bouchta Rhanizar

Journal of Mathematics Research, 2020, vol. 12, issue 5, 27

Abstract: We consider the constrained optimization problem defined by- $$f(x^*) = \min_{x \in X} f(x) \eqno (1)$$ where the function $f$ - $ \pmb{\mathbb{R}}^{n} \longrightarrow \pmb{\mathbb{R}}$ is convex on a closed convex set X. In this work, we will give a new method to solve problem (1) without bringing it back to an unconstrained problem. We study the convergence of this new method and give numerical examples.

Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.ccsenet.org/journal/index.php/jmr/article/download/0/0/43554/46067 (application/pdf)
http://www.ccsenet.org/journal/index.php/jmr/article/view/0/43554 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:jmrjnl:v:12:y:2020:i:5:p:27

Access Statistics for this article

More articles in Journal of Mathematics Research from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().