Add to ORKGIn this paper a new algorithm is developed to minimize linearly constrained non-smooth optimization problem for convex objective functions. The algorithm is based on the concept of codifferential. The convergence of the proposed minimization algorithm is proved and results of numerical experiments using a set of test problems with nonsmooth convex objective function are reported
A method, called an augmented subgradient method, is developed to solve unconstrained nonsmooth diff...
In this paper we introduce a new approach to solve constrained nonlinear non-smooth prograing proble...
In this paper, we investigate a class of constrained nonsmooth convex optimization problems, that is...
In this paper a new algorithm is developed to minimize linearly constrained non-smooth optimization ...
A new algorithm is developed based on the concept of codifferential for minimizing the difference of...
In this paper, a new algorithm to locally minimize nonsmooth functions represented as a difference o...
In this paper we propose a new approach for constructing efficient schemes for nonsmooth convex opti...
In this thesis, various numerical methods are developed to solve nonsmooth and in particular, noncon...
This chapter is devoted to algorithms for solving nonsmooth unconstrained difference of convex optim...
In this paper, a method for solving constrained convex optimization problems is introduced. The prob...
AbstractA readily implementable algorithm is proposed for minimizing any convex, not necessarily dif...
http://deepblue.lib.umich.edu/bitstream/2027.42/3639/5/bbm0223.0001.001.pdfhttp://deepblue.lib.umich...
Abstract. The problem of maximizing a nonsmooth convex function over an arbitrary set is considered....
In this article, we discuss a nondifferentiable nonlinear penalty method for an optimization problem...
Abstract. In this paper, we propose a smoothing augmented Lagrangian method for finding a stationary...
A method, called an augmented subgradient method, is developed to solve unconstrained nonsmooth diff...
In this paper we introduce a new approach to solve constrained nonlinear non-smooth prograing proble...
In this paper, we investigate a class of constrained nonsmooth convex optimization problems, that is...
In this paper a new algorithm is developed to minimize linearly constrained non-smooth optimization ...
A new algorithm is developed based on the concept of codifferential for minimizing the difference of...
In this paper, a new algorithm to locally minimize nonsmooth functions represented as a difference o...
In this paper we propose a new approach for constructing efficient schemes for nonsmooth convex opti...
In this thesis, various numerical methods are developed to solve nonsmooth and in particular, noncon...
This chapter is devoted to algorithms for solving nonsmooth unconstrained difference of convex optim...
In this paper, a method for solving constrained convex optimization problems is introduced. The prob...
AbstractA readily implementable algorithm is proposed for minimizing any convex, not necessarily dif...
http://deepblue.lib.umich.edu/bitstream/2027.42/3639/5/bbm0223.0001.001.pdfhttp://deepblue.lib.umich...
Abstract. The problem of maximizing a nonsmooth convex function over an arbitrary set is considered....
In this article, we discuss a nondifferentiable nonlinear penalty method for an optimization problem...
Abstract. In this paper, we propose a smoothing augmented Lagrangian method for finding a stationary...
A method, called an augmented subgradient method, is developed to solve unconstrained nonsmooth diff...
In this paper we introduce a new approach to solve constrained nonlinear non-smooth prograing proble...
In this paper, we investigate a class of constrained nonsmooth convex optimization problems, that is...