Title of article
A Subgradient Method for Unconstrained Nonconvex Nonsmooth Optimization
Author/Authors
Maleknia, M University of Isfahan
Pages
12
From page
31
To page
42
Abstract
We propose an iterative method that solves an uncon-strained nonconvex nonsmooth optimization problem. The proposed
method is a descent method that uses subgradients at each iteration and contains very simple procedures for finding descent directions and
for solving line search subproblems. The convergence of the algorithms
is studied.
Keywords
Nonsmooth optimization , Subgradient method
Journal title
Astroparticle Physics
Serial Year
2017
Record number
2440476
Link To Document