Results 111 to 120 of about 24,030 (229)

A new method for nonsmooth convex optimization

open access: yesJournal of Inequalities and Applications, 1998
A new method for minimizing a proper closed convex function is proposed and its convergence properties are studied. The convergence rate depends on both the growth speed off at minimizers and the choice of proximal parameters.
Birge JR, Wel Z, Qi L
doaj  

NonOpt: Nonconvex, Nonsmooth Optimizer

open access: yes
NonOpt, a C++ software package for minimizing locally Lipschitz objective functions, is presented. The software is intended primarily for minimizing objective functions that are nonconvex and/or nonsmooth. The package has implementations of two main algorithmic strategies: a gradient-sampling and a proximal-bundle method.
Curtis, Frank E., Zebiane, Lara
openaire   +2 more sources

Second order optimality conditions in nonsmooth unconstrained optimization

open access: yes, 1998
Summary: Second order necessary and sufficient conditions are given for a nonsmooth function \(f\) defined in a Banach space to attain a minimum at a point in the interior of its domain. At the beginning sufficient conditions in terms of Riemann type derivatives are introduced.
IVANOV, IVAN GINCHEV, GUERRAGGIO, ANGELO
openaire   +3 more sources

Home - About - Disclaimer - Privacy