A New Definition for Generalized First Derivative of Nonsmooth Functions

In this paper, we define a functional optimization problem corresponding to smooth functions which its optimal solution is first derivative of these functions in a domain. These functional optimization problems are applied for non-smooth functions which by solving these problems we obtain a kind of generalized first derivatives. For this purpose, a linear programming problem corresponding functional optimization problem is obtained which their optimal solutions give the approximate generalized first derivative. We show the efficiency of our approach by obtaining derivative and generalized derivative of some smooth and nonsmooth functions respectively in some illustrative examples.

A NONMOTOTONE ALGORITHM FOR MINIMIZING NONSMOOTH COMPOSITE FUNCTIONS

In this paper, we present a nonmonotone algorithm for solving nonsmooth composite optimization problems. The objective function of these problems is composited by a nonsmooth convex function and a differentiable function. The method generates the search directions by solving quadratic programming successively, and makes use of the nonmonotone line search instead of the usual Armijo-type line search. Global convergence is proved under standard assumptions. Numerical results are given.

DIFFERENCE SCHEME FOR AN INITIAL-BOUNDARY VALUE PROBLEM FOR LINEAR COEFFICIENT-VARIED PARABOLIC DIFFERENTIAL EQUATION WITH A NONSMOOTH BOUNDARY LAYER FUNCTION

In this paper, using nonumiform mesh and exponentially fitted difference method,a uniformly convergent difference scheme .for an initial-boundary value problem of linear parabolic differential equation with the nonsmooth boundary layer function with respect to small parameter ε is given, and error estimate and numerical result are also given.

NONDESCENT SUBGRADIENT METHOD FOR NONSMOOTH CONSTRAINED MINIMIZATION

A kind of nondecreasing subgradient algorithm with appropriate stopping rule has been proposed for nonsmooth constrained minimization problem. The dual theory is invoked in dealing with the stopping rule and general global minimiizing algorithm is employed as a subroutine of the algorithm. The method is expected to tackle a large class of nonsmooth constrained minimization problem.

A SQP METHOD FOR MINIMIZING A CLASS OF NONSMOOTH FUNCTIONS

In this paper,we present a successive quadratic programming(SQP)method for minimizing a class of nonsmooth functions,which are the sum of a convex function and a nonsmooth composite function.The method generates new iterations by using the Armijo-type line search technique after having found the search directions.Global convergence property is established under mild assumptions.Numerical results are also offered.

The Embedding Method for Nonsmooth Equations

In this paper. we present a class of’ embedding methods for nonsmooth equations. Under suitable conditions, we Prove that there exists a homotopy solution curve, which is Unique and continuous. We also prove that the solution curve is singlcvalue-d with respect to the homotopy parameter. Then we construct all efficient algorithm for this class of equations and prove its convcrgcnce. Filially, we apply the algorithm to the nonlinear complementarity problem. The numerical results show that tile algorithm is satisfacotry.

Higher-Order Minimizers and Generalized (F,<i>ρ</i>)-Convexity in Nonsmooth Vector Optimization over Cones

In this paper, we introduce the concept of a (weak) minimizer of order k for a nonsmooth vector optimization problem over cones. Generalized classes of higher-order cone-nonsmooth (F, ρ)-convex functions are introduced and sufficient optimality results are proved involving these classes. Also, a unified dual is associated with the considered primal problem, and weak and strong duality results are established.

Nonsmooth Optimization Algorithms in Some Problems of Fracture Dynamics

Mathematical statement of elastodynamic contact problem for cracked body with considering unilateral restrictions and friction of the crack faces is done in classical and weak forms. Different variational formulations of unilateral contact problems with friction based on boundary variational principle are considered. Nonsmooth optimization algorithms of Udzawa’s type for solution of unilateral contact problem with friction have been developed. Convergence of the proposed algorithms has been studied numerically.

A New Global Asymptotic Stability Result of Delayed Neural Networks via Nonsmooth Analysis

In the paper, we obtain new sufficient conditions ensuring existence, uniqueness, and asymptotic stability of the equilibrium point for delayed neural network via nonsmooth analysis, which makes use of the Lipschitz property of the functions. Based on this tool of nonsmooth analysis, we first obtain a couple of general results concerning the existence and uniqueness of the equilibrium point. Then we drive some new sufficient conditions ensuring global asymptotic stability of the equilibrium point. Finally, there are the illustrative examples feasibility and effectiveness of our results. Throughout our paper, the activation function is a more general function which has a wide application.

On Generalized High Order Derivatives of Nonsmooth Functions

In this paper, we proposed a Extension Definition to derive, simultaneously, the first, second and high order generalized derivatives for non-smooth functions, in which the involved functions are Riemann integrable but not necessarily locally Lipschitz or continuous. Indeed, we define a functional optimization problem corresponding to smooth functions where its optimal solutions are the first and second derivatives of these functions in a domain. Then by applying these functional optimization problems for non-smooth functions and using this method we obtain generalized first derivative (GFD) and generalized second derivative (GSD). Here, the optimization problem is approximated with a linear programming problem that by solving of which, we can obtain these derivatives, as simple as possible. We extend this approach for obtaining generalized high order derivatives (GHODs) of non-smooth functions, simultaneously. Finally, for efficiency of our approach some numerical examples have been presented.

NONSMOOTH CRITICAL POINT THEOREMS AND ITS APPLICATIONS TO QUASILINEAR SCHRDINGER EQUATIONS

In this paper, the existence and nonexistence of solutions to a class of quasilinear elliptic equations with nonsmooth functionals are discussed, and the results obtained are applied to quasilinear Schr¨odinger equations with negative parameter which arose from the study of self-channeling of high-power ultrashort laser in matter.

Nonsmooth finite-time control of uncertain second-order nonlinear systems

Nonsmooth 有限时间的稳定控制法律为双综合者系统被开发了。这篇论文的目的是进一步探索不明确的秒顺序的一种一般形式的有限时间的追踪控制问题仿射的有终端滑动的新形式的非线性的系统模式(TSM ) 。没有奇特问题，不连续、连续的有限时间的控制器也分别地被开发。完全的坚韧性能与前者被获得，并且与常规界面层方法相比提高了坚韧性能与后者被表示为明确的围住的功能。稳定并且追踪的问题上的模拟结果被介绍表明控制算法的有效性。

Nonsmooth Equations of K-T Systems for a Constrained Minimax Problem

Using K-T optimality condition of nonsmooth optimization, we establish two equivalent systems of the nonsmooth equations for the constrained minimax problem directly. Then generalized Newton methods are applied to solve these systems of the nonsmooth equations. Thus a new approach to solving the constrained minimax problem is developed.

OPTIMALITY CONDITIONS AND DUALITY RESULTS FOR NONSMOOTH VECTOR OPTIMIZATION PROBLEMS WITH THE MULTIPLE INTERVAL-VALUED OBJECTIVE FUNCTION

In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a(weakly) LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further,the sufficient optimality conditions for a(weakly) LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple intervalobjective function are convex.

Merit functions for nonsmooth complementarity problems and related descent algorithm

Under some assumptions, the solution set of a nonlinear complementarity problem coincides with the set of local minima of the corresponding minimization problem. This paper uses a family of new merit functions to deal with nonlinear complementarity problem where the underlying function is assumed to be a continuous but not necessarily locally Lipschitzian map and gives a descent algorithm for solving the nonsmooth continuous complementarity problems. In addition, the global convergence of the derivative free descent algorithm is also proved.

Newton type methods for solving nonsmooth equations

Numerical methods for the solution of nonsmooth equations are studied. A new subdifferential for a locally Lipschitzian function is proposed. Based on this subdifferential, Newton methods for solving nonsmooth equations are developed and their convergence is shown. Since this subdifferential is easy to be computed, the present Newton methods can be executed easily in some applications.

Solving constrained minimax problem via nonsmooth equations method

A new nonsmooth equations model of constrained minimax problem was de-rived. The generalized Newton method was applied for solving this system of nonsmooth equations system. A new algorithm for solving constrained minimax problem was established. The local superlinear and quadratic convergences of the algorithm were discussed.

NONSMOOTH MODEL FOR PLASTIC LIMIT ANALYSIS AND ITS SMOOTHING ALGORITHM

By means of Lagrange duality theory of the convex program, a dual problem of Hill's maximum plastic work principle under Mises' yield condition has been derived and whereby a non-differentiable convex optimization model for the limit analysis is developed. With this model, it is not necessary to linearize the yield condition and its discrete form becomes a minimization problem of the sum of Euclidean norms subject to linear constraints. Aimed at resolving the non-differentiability of Euclidean norms, a smoothing algorithm for the limit analysis of perfect-plastic continuum media is proposed. Its efficiency is demonstrated by computing the limit load factor and the collapse state for some plane stress and plain strain problems.

NONLINEAR KRYLOV SUBSPACE METHODS FOR SOLVING NONSMOOTH EQUATIONS

Newton-FOM (Full Orthogonalization Method) algorithm and Newton-GMRES (Generalized Minimum Residual Method) algorithm for solving nonsmooth equations are presented. It is proved that these Krylov subspace algorithms have the locally quadratic convergence.Numerical experiments demonstrate the effectiveness of the algorithms.

Interval Algorithm for a Kind of Nonsmooth Global Optimization

Based on the interval analysis,a practical interval algorithm is developed for finding all global minimizers of a nonsmooth function on a closed domain XR n, which is given by defining a special derivative to the function and using the interval inclusion of derivative. Both theoretical analysis and numerical results show that this method is practical and effective.