Showing 1 - 10 of 1,648
Persistent link: https://www.econbiz.de/10005598380
Persistent link: https://www.econbiz.de/10004152195
Persistent link: https://www.econbiz.de/10004768583
Persistent link: https://www.econbiz.de/10004014317
are based on stability properties for nonlinear programs. The theory is illustrated by some numerical examples. Copyright …
Persistent link: https://www.econbiz.de/10010896443
In this paper, we develop new subgradient methods for solving nonsmooth convex optimization problems. These methods are the first ones, for which the whole sequence of test points is endowed with the worst-case performance guarantees. The new methods are derived from a relaxed estimating...
Persistent link: https://www.econbiz.de/10010927696
We propose a new subgradient method for the minimization of nonsmooth convex functions over a convex set. To speed up computations we use adaptive approximate projections only requiring to move within a certain distance of the exact projections (which decreases in the course of the algorithm)....
Persistent link: https://www.econbiz.de/10010998277
In this paper we analyze several new methods for solving optimization problems with the objective function formed as a sum of two convex terms: one is smooth and given by a black-box oracle, and another is general but simple and its structure is known. Despite to the bad properties of the sum,...
Persistent link: https://www.econbiz.de/10005008277
<Para ID="Par1">Clustering is an important problem in data mining. It can be formulated as a nonsmooth, nonconvex optimization problem. For the most global optimization techniques this problem is challenging even in medium size data sets. In this paper, we propose an approach that allows one to apply local...</para>
Persistent link: https://www.econbiz.de/10011241248