Results 71 to 80 of about 126 (94)
Prediction and control of cholera outbreak: Study case of Cameroon. [PDF]
Hameni Nkwayep C +2 more
europepmc +1 more source
Constructive techniques for zeros of monotone mappings in certain Banach spaces. [PDF]
Diop C, Sow TM, Djitte N, Chidume CE.
europepmc +1 more source
The affine Pólya-Szegö principle: Equality cases and stability.
Wang T.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Minimization of Locally Lipschitzian Functions
SIAM Journal on Optimization, 1991Summary: This paper presents a globally convergent model algorithm for the minimization of a locally Lipschitzian function. The algorithm is built on an iteration function of two arguments, and the convergence theory is developed parallel to analogous results for the problem of solving systems of locally Lipschitzian equations.
Jong-Shi Pang +2 more
openaire +3 more sources
A trust region algorithm for minimization of locally Lipschitzian functions
Mathematical Programming, 1994The authors prove the global convergence of the classical trust region algorithm in the non-smooth case where the objective function is only locally Lipschitzian. The result is interesting.
Liqun Qi 0001, Jie Sun 0001
openaire +3 more sources
Solution of monotone complementarity problems with locally Lipschitzian functions
Mathematical Programming, 1997The paper deals with complementarity problems CP(F), where the underlying function F is assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP(F) as a system of equations (Phi)(x) = 0 or as the problem of minimizing the merit function (psi) =1/2 ^ 2_2, we extend results which hold for sufficiently smooth functions F to ...
Andreas Fischer
openaire +4 more sources
Some brief observations in minimizing the sum of locally Lipschitzian functions
Optimization Letters, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wim van Ackooij +1 more
openaire +5 more sources
A nonmonotone trust region algorithm for minimization of locally lipschitzian functions
2010 3rd International Congress on Image and Signal Processing, 2010The classical trust region algorithm was extended to the nonsmooth minimization problem successful by Qi and Sun. Combining the trust region algorithm of Qi and Sun with the nonmonotone technique, this paper present a nonmonotone trust region algorithm for the unconstrained nonsmooth optimization problems where the objective function is locally ...
Min Xi, Yan Wu, Houchun Zhou
openaire +3 more sources
Locally lipschitzian guiding function method for ODEs
Nonlinear Analysis: Theory, Methods & Applications, 1998The author treats the existence of periodic solutions to the problem \[ x'(t) = f(t,x(t)), \quad x(0)=x(T), \tag{*} \] where \(f:[0,T] \times \mathbb{R}^n \to \mathbb{R}^n\) is a Carathéodory function with integrably bound growth. Under the assumption that \(f\) has a locally Lipschitzian guiding function \(V\) with Ind\((V) \neq 0\) it is proved that ...
openaire +3 more sources
A note on locally Lipschitzian functions
Mathematical Programming, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pritchard, G., Gürkan, G., Ozge, A.Y.
openaire +3 more sources

