Non-homogeneous continuous and discrete gradient systems‎: ‎the quasi-convex case

Authors

  • H. Khatibzadeh Department of Mathematics‎, ‎University‎ ‎of Zanjan‎, ‎P‎. ‎O‎. ‎Box 45195-313‎, ‎Zanjan‎, ‎Iran.
  • V. Mohebbi Department of Mathematics‎, ‎University‎ ‎of Zanjan‎, ‎P‎. ‎O‎. ‎Box 45195-313‎, ‎Zanjan‎, ‎Iran.
Abstract:

‎In this paper‎, ‎first we study the weak and strong convergence of solutions to the‎ ‎following first order nonhomogeneous gradient system‎ ‎$$begin{cases}-x'(t)=nablaphi(x(t))+f(t), text{a.e. on} (0,infty)\‎‎x(0)=x_0in Hend{cases}$$ to a critical point of $phi$‎, ‎where‎ ‎$phi$ is a $C^1$ quasi-convex function on a real Hilbert space‎ ‎$H$ with ${rm Argmin}phineqvarnothing$ and $fin L^1(0,+infty;H)$‎. ‎These results extend the‎ ‎results in the literature to non-homogeneous case‎. ‎Then the‎ ‎discrete version of the above system by backward Euler‎ ‎discretization has been studied‎. ‎Beside of the proof of the‎ ‎existence of the sequence given by the discrete system‎, ‎some‎‎results on‎ ‎the weak and strong convergence to the critical point of $phi$ are also proved‎. ‎These results when $phi$ is pseudo-convex (therefore the critical points‎ ‎are the same minimum points) may be applied in optimization for approximation of a‎ ‎minimum point of $phi$‎.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Generalized Homogeneous Quasi-Continuous Controllers

A new class of arbitrary-order homogeneous quasi-continuous sliding-mode controllers is proposed, containing numerous functional parameters. All controllers also have robust outputfeedback versions. A numerical procedure is for the first time established for setting the controller parameters. A finite-time stable 5-sliding mode is for the first time demonstrated.

full text

Discrete quasi-gradient features weighting algorithm

A new method of feature weighting, useful also for feature extraction has been described. It is quite efficient and gives quite accurate results. Weighting algorithm may be used with any kind of learning algorithm. The weighting algorithm with k-nearest neighbors model was used to estimate the best feature base for a given distance measure. Results obtained with this algorithm clearly show its ...

full text

On Non-homogeneous Generalized Linear Discrete Time Systems

In this article, we study the initial value problem of a class of nonhomogeneous generalized linear discrete time systems whose coefficients are square constant matrices. By using matrix pencil theory we obtain formulas for the solutions and we give necessary and sufficient conditions for existence and uniqueness of solutions. Moreover, we provide some numerical examples.

full text

Discrete Time Homogeneous and non-Homogeneous semi-Markov Reliability Models.∗

In this paper, we extend to our knowledge, for the first case, some reliability results obtained using homogeneous semi-Markov processes to the case of non-homogenous semi-Markov modelisation. Moreover, we apply some of our preceding results to give the numerical solutions and so the possibility to treat real life problems for which non-homogeneity in time is important.

full text

Discrete Groups and Non-riemannian Homogeneous Spaces

A basic question in geometry is to understand compact locally homogeneous manifolds, i.e., those compact manifolds that can be locally modelled on a homogeneous space J\H of a finite-dimensional Lie group H. This means that there is an atlas on a manifold M consisting of local diffeomorphisms with open sets in J\H where the transition functions between these open sets are given by translations ...

full text

A Stochastic Approach to the Convex Optimization of Non-convex Discrete Energy Systems

Energy systems (e.g. ventilation fans, refrigerators, and electrical vehicle chargers) often have binary or discrete states due to hardware limitations and efficiency characteristics. Typically, such systems have additional programmatic constraints, such as minimum dwell times to prevent short cycling. As a result, non-convex techniques, like dynamic programming, are generally required for opti...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 43  issue 6

pages  2099- 2110

publication date 2017-11-30

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023