A Subgradient Method for Unconstrained Nonconvex Nonsmooth Optimization
|
|
|
|
|
نویسنده
|
maleknia morteza
|
منبع
|
journal of mathematical extension - 2017 - دوره : 11 - شماره : 3 - صفحه:31 -42
|
چکیده
|
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 iterationand contains very simple procedures for finding descent directions and for solving line search subproblems. the convergence of the algorithms is studied.
|
کلیدواژه
|
Nonsmooth optimization ,Subgradient method
|
آدرس
|
university of isfahan, department of mathematics, iran
|
پست الکترونیکی
|
m.maleknia@sci.ui.ac.ir
|
|
|
|
|