Journal article · 2017 · Open access

A Subgrudient Method for Unconstrained Nonconvex Nonsmooth Optimization

Morteza Maleknia

Journal of mathematical extension., 11, 31–42 · Published 2 August 2017

Read the free full textCite this paper

In brief

“A Subgrudient Method for Unconstrained Nonconvex Nonsmooth Optimization” is a 2017 journal article by Morteza Maleknia, published in Journal of mathematical extension.. OpenAlex counts 0 citations as of 16 November 2026. It is open access: the full text is free to read at Journal of mathematical extension..

Citations
0
Authors
1

Abstract

We propose an iterative method that solves an unconstrained nonconvex nonsmooth optimization problem. The proposed method is a descent method that uses subgradients at each iteration and contains a very simple procedures for finding descent directions and for solving line search subproblems. The convergence of the algorithms will be studied.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Maleknia, M. (2017). A Subgrudient Method for Unconstrained Nonconvex Nonsmooth Optimization. Journal of mathematical extension., 11, 31–42. https://www.ijmex.com/index.php/ijmex/article/download/528/316

MLA 9

Maleknia, Morteza. “A Subgrudient Method for Unconstrained Nonconvex Nonsmooth Optimization.” Journal of mathematical extension., vol. 11, 2017, pp. 31–42. https://www.ijmex.com/index.php/ijmex/article/download/528/316.

Chicago

Maleknia, Morteza. 2017. “A Subgrudient Method for Unconstrained Nonconvex Nonsmooth Optimization.” Journal of mathematical extension. 11: 31–42. https://www.ijmex.com/index.php/ijmex/article/download/528/316.

Harvard

Maleknia, M. (2017) ‘A Subgrudient Method for Unconstrained Nonconvex Nonsmooth Optimization’, Journal of mathematical extension., 11, pp. 31–42. Available at: https://www.ijmex.com/index.php/ijmex/article/download/528/316.

IEEE

M. Maleknia, “A Subgrudient Method for Unconstrained Nonconvex Nonsmooth Optimization,” Journal of mathematical extension., vol. 11, pp. 31–42, 2017.

BibTeX

@article{maleknia2017subgrudient,
  title     = {{A Subgrudient Method for Unconstrained Nonconvex Nonsmooth Optimization}},
  author    = {Maleknia, Morteza},
  journal   = {Journal of mathematical extension.},
  year      = {2017},
  volume    = {11},
  pages     = {31--42},
  url       = {https://www.ijmex.com/index.php/ijmex/article/download/528/316}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis

  • subgradients
  • unconstrained optimization
  • nonsmooth nonconvex optimization
  • descent methods
  • descent direction
  • line search
  • convergence analysis

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Maleknia, M. (2017). A Subgrudient Method for Unconstrained Nonconvex Nonsmooth Optimization. Journal of mathematical extension., 11, 31–42. https://www.ijmex.com/index.php/ijmex/article/download/528/316

How many times has this paper been cited?

0 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access: read the free full text at Journal of mathematical extension..

Who wrote this paper?

Morteza Maleknia.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.